Open problems of Paul Erdös in graph theory
暂无分享,去创建一个
[1] M Axenovich,et al. On set systems without weak 3-Delta-subsystems , 1995, Discret. Math..
[2] József Beck,et al. On size Ramsey number of paths, trees, and circuits. I , 1983, J. Graph Theory.
[3] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .
[4] Vojtech Rödl,et al. 2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs , 1993, Discret. Math..
[5] Jean A. Larson,et al. A Diamond Example of an Ordinal Graph with No Infinite Paths , 1990, Ann. Pure Appl. Log..
[6] Miklós Simonovits,et al. Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions , 1974, Discret. Math..
[7] Jeff Kahn,et al. Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors , 1992, J. Comb. Theory, Ser. A.
[8] P. Erdös. Problems and Results on Finite and Infinite Graphs , 1975 .
[9] M. Simonovits,et al. An extremal graph problem , 1972 .
[10] Nicholas C. Wormald,et al. Random Graph Processes with Degree Restrictions , 1992, Combinatorics, Probability and Computing.
[11] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .
[12] Vojtech Rödl,et al. The Ramsey number of a graph with bounded maximum degree , 1983, J. Comb. Theory, Ser. B.
[13] W. G. Brown,et al. On odd circuits in chromatic graphs , 1969 .
[14] Jean A. Larson,et al. A short proof of a partition theorem for the ordinal ωω , 1973 .
[15] Paul Erdbs. Problems and Results in Combinatorial Analysis and Combinatorial Number Theory , .
[16] Zoltán Füredi,et al. New Asymptotics for Bipartite Turán Numbers , 1996, J. Comb. Theory, Ser. A.
[17] Fred Galvin,et al. Pinning countable ordinals , 1975 .
[18] G. Dirac. A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs , 1952 .
[19] Joel H. Spencer,et al. Asymptotic lower bounds for Ramsey functions , 1977, Discret. Math..
[20] C. C. Chang,et al. A Partition Theorem for the Complete Graph on omegaomega , 1972, J. Comb. Theory, Ser. A.
[21] Noga Alon. Subdivided graphs have linear ramsey numbers , 1994, J. Graph Theory.
[22] Paul Erdös,et al. How to make a graph bipartite , 1987, J. Comb. Theory, Ser. B.
[23] A. Hajnal,et al. A negative partition relation. , 1971, Proceedings of the National Academy of Sciences of the United States of America.
[24] János Komlós,et al. A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.
[25] J. Rodriguez,et al. Problem (2) , 1994 .
[26] Reinhard Diestel,et al. Directions in infinite graph theory and combinatorics , 1992 .
[27] P. Erdös,et al. Graph Theory and Probability , 1959 .
[28] William T. Trotter,et al. Induced matchings in cubic graphs , 1993, J. Graph Theory.
[29] Simonovits Miklós,et al. The extremal graph problem of the icosahedron , 1974 .
[30] Vojtěch Rödl. On the chromatic number of subgraphs of a given graph , 1977 .
[31] Noga Alon,et al. The concentration of the chromatic number of random graphs , 1997, Comb..
[32] Joel Friedman,et al. Expanding graphs contain all small trees , 1987, Comb..
[33] Vojtech Rödl,et al. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..
[34] Noga Alon,et al. Choosability and fractional chromatic numbers , 1997, Discret. Math..
[35] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[36] H. L. Abbott,et al. On finite Δ-systems , 1974, Discret. Math..
[37] James E. Baumgartner,et al. Partition relations for uncountable ordinals , 1975 .
[38] Zoltán Füredi,et al. Graphs without quadrilaterals , 1983, J. Comb. Theory, Ser. B.
[39] P. Erdos,et al. A LIMIT THEOREM IN GRAPH THEORY , 1966 .
[40] P. Erdös. On an extremal problem in graph theory , 1970 .
[41] Michael Krivelevich,et al. On the Edge Distribution in Triangle-free Graphs , 1995, J. Comb. Theory, Ser. B.
[42] Vojtech Rödl,et al. Hypergraphs do not jump , 1984, Comb..
[43] Lajos Rónyai,et al. Norm-graphs and bipartite turán numbers , 1996, Comb..
[44] Rephael Wenger,et al. Extremal graphs with no C4's, C6's, or C10's , 1991, J. Comb. Theory, Ser. B.
[45] Peter Frankl. An extremal problem for 3-graphs , 1978 .
[46] Saharon Shelah,et al. Consistency of positive partition theorems for graphs and models , 1989 .
[47] Peter Frankl,et al. Intersection theorems with geometric consequences , 1981, Comb..
[48] Paul Erdös,et al. Minimal decompositions of graphs into mutually isomorphic subgraphs , 1981, Comb..
[49] P. Erdos,et al. Problems and Results in Graph Theory and Combinatorial Analysis , 1977 .
[50] Miklós Simonovits,et al. Compactness results in extremal graph theory , 1982, Comb..
[51] Paul Erdös,et al. Clique partitions and clique coverings , 1988, Discret. Math..
[52] Fan Chung Graham. On the ramsey numbers N(3, 3, ...3;2) , 1973, Discret. Math..
[53] Paul Erdös,et al. Chromatic number of finite and infinite graphs and hypergraphs , 1985, Discret. Math..
[54] Paul Erdös,et al. Matchings from a set below to a set above , 1991, Discret. Math..
[55] Edward Dobson,et al. The Erdős-Sós conjecture for graphs of girth 5 , 1996, Discret. Math..
[56] Andras Hajnal,et al. True Embedding Partition Relations , 1993 .
[57] D. R. Lick,et al. The Theory and Applications of Graphs. , 1983 .
[58] Richard H. Schelp,et al. On cycle - Complete graph ramsey numbers , 1978, J. Graph Theory.
[59] P. Erdös,et al. On the structure of linear graphs , 1946 .
[60] Paul Erdős. A Tribute to Paul Erdős: Some of my favourite unsolved problems , 1990 .
[61] Richard Laver. AN (ℵ2, ℵ2, ℵ0) - SATURATED IDEAL ON Ω1 , 1982 .
[62] Igor Rivin,et al. On some extremal problems in graph theory , 1999 .
[63] A. Rényii,et al. ON A PROBLEM OF GRAPH THEORY , 1966 .
[64] László Pyber,et al. Covering the Edges of a Connected Graph by Paths , 1996, J. Comb. Theory, Ser. B.
[65] Daniel J. Kleitman,et al. On the number of graphs without 4-cycles , 1982, Discret. Math..
[66] Ervin Györi. On the number of C5's in a triangle-free graph , 1989, Comb..
[67] Paul Erdös,et al. Partition Relations and Transitivity Domains of Binary Relations , 1967 .
[68] Endre Szemerédi,et al. On Almost Bipartite Large Chromatic Graphs , 1982 .
[69] Geoffrey Exoo,et al. A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers , 1994, Electron. J. Comb..
[70] Paul Erdös. Some new problems and results in Graph Theory and other branches of Combinatorial Mathematics , 1981 .
[71] Alexandr V. Kostochka. A class of constructions for turán’s (3, 4)-problem , 1982, Comb..
[72] P. E. -. R. L. Graham,et al. ON PARTITION THEOREMS FOR FINITE GRAPHS , 1973 .
[73] Walter Deuber. A generalization of Ramsey's theorem for regular trees , 1975 .
[74] P. Erdős. Some remarks on chromatic graphs , 1967 .
[75] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[76] Joel H. Spencer,et al. Sharp concentration of the chromatic number on random graphsGn, p , 1987, Comb..
[77] Lars Døvling Anderson. The strong chromatic index of a cubic graph is at most 10 , 1992 .
[78] Richard H. Schelp,et al. Graphs with Linearly Bounded Ramsey Numbers , 1993, J. Comb. Theory, Ser. B.
[79] A. Frieze. ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS , 1988 .
[80] Zoltán Füredi,et al. On the Number of Edges of Quadrilateral-Free Graphs , 1996, J. Comb. Theory, Ser. B.
[81] Richard H. Schelp,et al. Ramsey-minimal graphs for multiple copies , 1978 .
[82] Peter Winkler,et al. On the Size of a Random Maximal Graph , 1995, Random Struct. Algorithms.
[83] W. G. Brown. On an open problem of Paul Turan concerning 3-graphs , 1983 .
[84] Paul Erdős. Some recent problems and results in graph theory , 1997 .
[85] Fan Chung,et al. On unavoidable graphs , 1983 .
[86] P. Erdös. Problems and results on chromatic numbers in finite and infinite graphs , 1985 .
[87] Endre Szemerédi,et al. More results on Ramsey—Turán type problems , 1983, Comb..
[88] András Hajnal,et al. Extensions of the Erd˝ Os-rado Theorem , 1993 .
[89] S. Burr. ON THE MAGNITUDE OF GENERALIZED RAMSEY NUMBERS FOR GRAPHS , 1973 .
[90] Zsolt Tuza,et al. Covering the cliques of a graph with vertices , 1992, Discret. Math..
[91] M. Simonovits,et al. Cycles of even length in graphs , 1974 .
[92] Tomasz Luczak. The chromatic number of random graphs , 1991, Comb..
[93] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .
[94] Fan Chung Graham,et al. The maximum number of edges in a 3-graph not containing a given star , 1987, Graphs Comb..
[95] Fan Chung Graham. Subgraphs of a hypercube containing no small even cycles , 1992, J. Graph Theory.
[96] Paul Erdös,et al. On unavoidable hypergraphs , 1987, J. Graph Theory.
[97] J. Spencer. Intersection Theorems for Systems of Sets , 1977, Canadian Mathematical Bulletin.
[98] J. Beck,et al. On 3-chromatic hypergraphs , 1978, Discret. Math..
[99] F. Lazebnik,et al. A new series of dense graphs of high girth , 1995, math/9501231.
[100] Béla Bollobás,et al. On a Ramsey-Turán type problem , 1976, Journal of combinatorial theory. Series B (Print).
[101] Vojtech Rödl,et al. On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree , 1996, J. Comb. Theory, Ser. B.
[102] Paul Erdös,et al. Maximal antiramsey graphs and the strong chromatic number , 1989, J. Graph Theory.
[103] Marston D. E. Conder,et al. Hexagon-free subgraphs of hypercubes , 1993, J. Graph Theory.
[104] János Komlós,et al. On the distribution of cycle lengths in graphs , 1984, J. Graph Theory.
[105] P. Erdös. Problems and Results on Graphs and Hypergraphs: Similarities and Differences , 1990 .
[106] Noga Alon,et al. Spanning subgraphs of random graphs , 1992, Graphs Comb..
[107] Fred B. Schneider,et al. A Theory of Graphs , 1993 .
[108] Edward T. Ordman,et al. THE DIFFERENCE BETWEEN THE CLIQUE NUMBERS OF A GRAPH , 2022 .
[109] Robert E. Woodrow,et al. Finite and Infinite Combinatorics in Sets and Logic , 1993 .
[110] Ronald L. Graham,et al. On Multicolor Ramsey Numbers for Complete Bipartite Graphs , 1975 .
[111] P. Erdös. On circuits and subgraphs of chromatic graphs , 1962 .
[112] Paul Erdös,et al. Intersection theorems for systems of sets (III) , 1974, Journal of the Australian Mathematical Society.
[113] P. ERDŐS,et al. UNSOLVED AND SOLVED PROBLEMS IN SET THEORY , 1971 .
[114] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[115] Huishan Zhou,et al. On the ascending star subgraph decomposition of star forests , 1994, Comb..
[116] Andrew Thomason,et al. An upper bound for some ramsey numbers , 1988, J. Graph Theory.
[117] Vojtěch Rödl,et al. Nearly bipartite graphs with large chromatic number , 1982, Comb..
[118] E. C. Milner,et al. Set mappings and polarized partition relations bY , 1969 .
[119] P. Erdös,et al. Ramsey Numbers for Cycles in Graphs , 1973 .
[120] Béla Bollobás,et al. The chromatic number of random graphs , 1988, Comb..
[121] Fan Chung,et al. Unavoidable Stars in 3-Graphs , 1983 .
[122] E. C. Milner,et al. A partition relation for triples using a model of Todorcevic , 1991, Discret. Math..
[123] Richard H. Schelp,et al. A local density condition for triangles , 1994, Discret. Math..
[124] D. W. MATULA. Expose-and-merge exploration and the chromatic number of a random graph , 1987, Comb..
[125] Paul Erdös,et al. ON THE PRODUCT OF THE POINT AND LINE COVERING NUMBERS OF A GRAPH , 1979 .
[126] A. Lubotzky,et al. Ramanujan graphs , 2017, Comb..
[127] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .
[128] Jeff Kahn. On a problem of Erdős and Lovász: Random lines in a projective plane , 1992, Comb..
[129] Paul Erdös,et al. Some problems in graph theory , 1974 .
[130] 赵光峰,et al. On the Ascending Subgraph Decomposition Problem , 1999 .
[131] Jason I. Brown. A vertex critical graph without critical edges , 1992, Discret. Math..
[132] P. Erdos,et al. The size Ramsey number , 1978 .
[133] Noga Alon,et al. Threshold Functions for H-factors , 1993, Comb. Probab. Comput..
[134] A. Thomason. A Disproof of a Conjecture of Erdős in Ramsey Theory , 1989 .
[135] Horst Sachs,et al. On colour critical graphs , 1985, FCT.
[136] P. Erdös. Some remarks on the theory of graphs , 1947 .
[137] Noga Alon,et al. AlmostH-factors in dense graphs , 1992, Graphs Comb..
[138] Paul Erdös,et al. Some of my Favourite Problems in Number Theory, Combinatorics, and Geometry , 1995 .
[139] Yoshiharu Kohayakawa,et al. The Induced Size-Ramsey Number of Cycles , 1995, Combinatorics, Probability and Computing.
[140] Alan M. Frieze,et al. On Subgraph Sizes in Random Graphs , 1992, Comb. Probab. Comput..
[141] Andrzej Rucinski,et al. Matching and covering the vertices of a random graph by copies of a given graph , 1992, Discret. Math..
[142] W. G. Brown,et al. On the existence of triangulated spheres in 3-graphs, and related problems , 1973 .
[143] Richard H. Schelp,et al. Some Complete Bipartite Graph - Tree Ramsey Numbers , 1988 .
[144] Joel H. Spencer,et al. Ramsey's Theorem - A New Lower Bound , 1975, J. Comb. Theory, Ser. A.
[145] Jean A. Larson. A GCH example of an ordinal graph with no infinite path , 1987 .
[146] J. Komlos,et al. First Occurrence of Hamilton Cycles in Random Graphs , 1985 .
[147] P. Erdos,et al. On the evolution of random graphs , 1984 .
[148] A. Hajnal,et al. On decomposition of graphs , 1967 .
[149] C. T. Benson. Minimal Regular Graphs of Girths Eight and Twelve , 1966, Canadian Journal of Mathematics.
[150] Jean A. Larson,et al. Ordinal Partition Behavior of Finite Powers of Cardinals , 1993 .
[151] Richard A. Duke. SYSTEMS OF FINITE SETS HAVING A COMMON INTERSECTION , 1977 .
[152] Endre Szemerédi,et al. Combinatorial Properties of Systems of Sets , 1978, J. Comb. Theory, Ser. A.
[153] M. Simonovits,et al. Cube-Supersaturated Graphs and Related Problems , 1982 .
[154] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[155] Jeong Han Kim,et al. The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.
[156] P. Erdős. Some extremal problems on families of graphs and related problems , 1978 .
[157] Paul Erdös,et al. Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs , 1982, J. Comb. Theory, Ser. A.
[158] Alexandr V. Kostochka,et al. Intersection Statements for Systems of Sets , 1997, J. Comb. Theory, Ser. A.