Zentralblatt MATH

Publications in Graph Theory
Zbl 015.17801  •  Erdös, Paul; Grünwald, T.; Weiszfeld, E. , On Eulerian lines in infinite graphs. ,
Mat. Fiz. Lapok 43, 129-140 (1936). , 05C99
Zbl 019.23602  •  Erdös, Paul; Grünwald, T.; Vazsonyi, E. , Über Euler-Linien unendlicher Graphen. (On Eulerian lines in infinite Graphs.) ,
J. Math. Phys., Mass. Inst. Techn. 17, 59-75 (1938). [Reviewer: MacLane (Cambridge, Mass.)] , 05C99
Zbl 044.38203  •  de Bruijn, N.G.; Erdös, Paul , A colour problem for infinite graphs and a problem in the theory of relations. ,
Nederl. Akad. Wet., Proc., Ser. A 54, 371-373 (1951); Indag. Math. 13, 371-373 (1951). [Reviewer: T.Szele] , 05C15 05C35
Zbl 063.01265  •  Erdös, Paul , Some set-theoretical properties of graphs. ,
Rev. Univ. Nac. Tucuman, Ser. A 3, 363-367 (1942). , 05C99
Zbl 063.01275  •  Erdös, Paul; Kakutani, S. , On non-denumerable graphs. ,
Bull. Am. Math. Soc. 49, 457-461 (1943). , 05C99
Zbl 063.01277  •  Erdös, Paul; Stone, A.H. , On the structure of linear graphs. ,
Bull. Am. Math. Soc. 52, 1087-1091 (1946). , 05C75
Zbl 092.15705  •  Erdös, Paul; Rényi, Alfréd , On random graphs. I. ,
Publ. Math., Debrecen 6, 290-297 (1959). [Reviewer: G.Ringel] , 05C80
Zbl 097.16402  •  Erdös, Paul; Rado, R. , A construction of graphs without triangles having preassigned order and chromatic number. ,
J. London Math. Soc. 35, 445-448 (1960). [Reviewer: H.Künneth] , 05C15 04A30
Zbl 097.39102  •  Erdös, Paul , Graph theory and probability. II. ,
Can. J. Math. 13, 346-352 (1961). [Reviewer: H.Künneth] , 05C99
Zbl 099.39401  •  Erdös, Paul , On a theorem of Rademacher-Turán. ,
Ill. J. Math. 6, 122-127 (1962). [Reviewer: A.Ádám] , 05C38
Zbl 103.16301  •  Erdös, Paul; Rényi, Alfréd , On the evolution of random graphs ,
Publ. Math. Inst. Hung. Acad. Sci., Ser. A 5, 17-61 (1960). [Reviewer: K.Culik] , 05C80
Zbl 103.16302  •  Erdös, Paul; Rényi, Alfréd , On the strength of connectedness of a random graph ,
Acta Math. Acad. Sci. Hung. 12, 261-267 (1961). [Reviewer: K.Culik] , 05C40 05C80
Zbl 103.39701  •  Erdös, Paul; Gallai, Tibor , Graphen mit Punkten vorgeschriebenen Grades. (Graphs with points of prescribed degree) ,
Mat. Lapok 11, 264-274 (1961). [Reviewer: A.Ádám] , 05C99
Zbl 106.12006  •  Erdös, Paul; Rényi, Alfréd , On the evolution of random graphs. II ,
Bull. Inst. Int. Stat. 38, No.4, 343-347 (1961). [Reviewer: G.Mihoc] , 05C80
Zbl 109.16502  •  Erdös, Paul , On circuits and subgraphs of chromatic graphs ,
Mathematika, London 9, 170-175 (1962). [Reviewer: F.Harary] , 05C15
Zbl 114.40004  •  Erdös, Paul , Remarks on a paper of Pósa ,
Publ. Math. Inst. Hung. Acad. Sci., Ser. A 7, 227-229 (1962). [Reviewer: A.Ádám] , 05C45
Zbl 116.01202  •  Erdös, Paul , On the number of complete subgraphs contained in certain graphs ,
Publ. Math. Inst. Hung. Acad. Sci., Ser. A 7, 459-464 (1962). [Reviewer: C.St.J.A.Nash-Williams] , 05C30
Zbl 118.18901  •  Erdös, Paul; Rényi, Alfréd , Asymmetric graphs ,
Acta Math. Acad. Sci. Hung. 14, 295-315 (1963). [Reviewer: K.Wagner] , 05C99
Zbl 121.40302  •  Erdös, Paul , On the number of triangles contained in certain graphs ,
Can. Math. Bull. 7, 53-56 (1964). [Reviewer: J.Sedlácek] , 05C30 05C38
Zbl 122.41902  •  Erdös, Paul; Moon, J.W. , On subgraphs of the complete bipartite graph ,
Can. Math. Bull. 7, 35-39 (1964). [Reviewer: H.Künneth] , 05C99
Zbl 123.17004  •  Erdös, Paul , On the structure of linear graphs. ,
Israel J. Math. 1, 156-160 (1963). [Reviewer: J.Sedlácek] , 05C99
Zbl 125.40501  •  Erdös, Paul; Hajnal, András , On complete topological subgraphs of certain graphs ,
Ann. Univ. Sci. Budapest. Rolando Eötvös, Sect. Math. 7, 143-149 (1964). [Reviewer: Gy.Katona] , 05C10
Zbl 136.44901  •  Erdös, Paul; Moser, L. , On the representation of directed graphs as unions of orderings ,
Publ. Math. Inst. Hung. Acad. Sci., Ser. A 9, 125-132 (1964). [Reviewer: J.Sedlácek] , 05C50
Zbl 137.43301  •  Erdös, Paul; Moon, J.W. , On sets of consistent arcs in a tournament ,
Can. Math. Bull. 8, 269-271 (1965). [Reviewer: H.A.Jung] , 05C20 05C35
Zbl 151.33701  •  Erdös, Paul; Hajnal, András , On chromatic number of graphs and setsystems ,
Acta Math. Acad. Sci. Hung. 17, 61-99 (1966). [Reviewer: H.A.Jung] , 05C15
Zbl 152.41201  •  Erdös, Paul; Hajnal, András , On chromatic graphs ,
Mat. Lapok 18, 1-4 (1967). [Reviewer: Cs.Pogány] , 05C15
Zbl 156.22302  •  Erdös, Paul , Some remarks on chromatic graphs ,
Colloq. Math. 16, dedie a Franciszek Leja, 253-256 (1967). [Reviewer: G.A.Dirac] , 05C15
Zbl 161.20501  •  Erdös, Paul , Extremal problems in graph theory ,
Theory Graphs Appl., Proc. Symp. Smolenice 1963, 29-36 (1964). [Reviewer: R.Halin] , 05C90
Zbl 164.24803  •  Erdös, Paul; Hajnal, András , On chromatic number of infinite graphs ,
Theory of Graphs, Proc. Colloq. Tihany, Hungary 1966, 83-98 (1968). [Reviewer: H.A.Jung] , 05C15
Zbl 167.22302  •  Erdös, Paul; Kleitman, Daniel J. , On coloring graphs to maximize the proportion of multicolored k-edges ,
J. Comb. Theory 5, 164-169 (1968). [Reviewer: R.Halin] , 05C15
Zbl 169.26601  •  Erdös, Paul; Hajnal, András , On decomposition of graphs ,
Acta Math. Acad. Sci. Hung. 18, 359-377 (1967). [Reviewer: H.A.Jung] , 05C70
Zbl 174.04104  •  Erdös, Paul; Rényi, Alfréd , On random matrices. II ,
Stud. Sci. Math. Hungar. 3, 459-464 (1968). [Reviewer: J.W.Moon] , 05C50
Zbl 177.52502  •  Erdös, Paul , On the number of complete subgraphs and circuits contained in graphs ,
Cas. Pestováni Mat. 94, 290-296 (1969). , 05C20 05C38
Zbl 187.21002  •  Erdös, Paul , Some applications of graph theory to number theory ,
Many Facets of Graph Theory, Proc. Conf. Western Michigan Univ., Kalamazoo/Mi. 1968, 77-82 (1969). , 05C90 11-02 00A07
Zbl 193.24302  •  Erdös, Paul , On even subgraphs of graphs ,
Mat. Lapok 18, 283-288 (1967). [Reviewer: B.Andrásfai] , 05C99
Zbl 194.25102  •  Erdös, Paul , Problems and results in chromatic graph theory ,
Proof Tech. Graph Theory, Proc. 2nd Ann Arbor Graph Theory Conf. 1968, 27-35 (1969). , 05C15 00A07
Zbl 194.25401  •  Elliott, P.D.; Erdös, Paul , Some matching theorems ,
J. Indian Math. Soc., n. Ser. 32, 215-219 (1968). [Reviewer: R.L.Hemminger] , 05C70
Zbl 194.25402  •  Erdös, Paul , Über die in Graphen enthaltenen saturierten planaren Graphen. (On the saturated planar graphs contained in graphs.) ,
Math. Nachr. 40, 13-17 (1969). [Reviewer: R.Halin] , 05C10
Zbl 203.56902  •  Erdös, Paul; Rényi, Alfréd , On the existence of a factor of degree one of a connected random graph ,
Acta Math. Acad. Sci. Hung. 17, 359-368 (1966). [Reviewer: K.Zaretskij (R.Z.Mat.1967, No.9B 199)] , 05C70 05C80
Zbl 209.28004  •  Erdös, Paul; Gerencsér, L.; Máté, A. , Problems of graph theory concerning optimal design ,
Combinat. Theory Appl., Colloquia Math. Soc. János Bolyai 4, 317-325 (1970). , 05C99 05B30
Zbl 213.51003  •  Bosák, J.; Erdös, Paul; Rosa, A. , Decompositions of complete graphs into factors with diameter two ,
Mat. Cas., Slovensk. Akad. Vied 21, 14-28 (1971). , 05C70
Zbl 221.05051  •  Erdös, Paul , Some unsolved problems in graph theory and combinatorial analysis. ,
Combinat. Math. Appl., Proc. Conf. Math. Inst., Oxford 1969, 97109 (1971). [Reviewer: G.Chartrand] , 05Cxx 05Axx
Zbl 231.05110  •  Erdös, Paul , On the graph-theorem of Paul Turán. ,
Mat. Lapok 21 (1970), 249-251 (1971). , 05C15
Zbl 232.05003  •  Erdös, Paul; Meir, A.; Sós, V.T.; Turán, P. , On some applications of graph theory. III. ,
Can. Math. Bull. 15, 27-32 (1972). , 05C90 05C99
Zbl 233.05123  •  Chvatal, V.; Erdös, Paul , A note on Hamiltonian circuits. ,
Discrete Math. 2, 111-113 (1972). , 05C45 05C38 05C40
Zbl 236.05119  •  Erdös, Paul; Meir, A.; Sos, V.T.; Turan, P. , On some applications of graph theory. I. ,
Discrete Math. 2, 207-228 (1972); correction ibid. 4, 90 (1973). , 05C90 31-99 52B45 54E35
Zbl 236.05120  •  Erdös, Paul; Hajnal, András , Problems and results in finite and infinite combinatorial analysis. ,
Ann. New York Acad. Sci. 175, 115-124 (1970). [Reviewer: H.A.Jung] , 05C99 05A99 00A07
Zbl 241.05111  •  Entringer, Roger C.; Erdös, Paul , On the number of unique subgraphs of a graph. ,
J. Comb. Theory, Ser. B 13, 112-115 (1972). , 05C99
Zbl 242.05113  •  Erdös, Paul; Hajnal, András; Milner, E.C. , Simple one-point extensions of tournaments. ,
Mathematika, Lond. 19, 57-62 (1972). [Reviewer: J.W.Moon] , 05C20
Zbl 242.05122  •  Erdös, Paul; Szemeredi, A. , On a Ramsey type theorem. ,
Period. Math. Hung. 2, 295-299 (1972). [Reviewer: J.E.Graver] , 05C15 05C35
Zbl 244.05114  •  Chvatal, V.; Erdös, Paul; Hedrlin, Z. , Ramsey's theorem and self-complementary graphs. ,
Discrete Math. 3, 301-304 (1972). , 05C99 05C35
Zbl 248.05114  •  Erdös, Paul; Spencer, Joel , Imbalances in k-colorations. ,
Networks 1, 379-385 (1972). [Reviewer: G.Chartrand] , 05C15
Zbl 253.05124  •  Brown, William G.; Erdös, Paul; Simonovits, Miklos , Extremal graph problems for directed graphs. ,
J. Comb. Theory, Ser. B 15, 77-93 (1973). , 05C20 05C35
Zbl 258.05112  •  Erdös, Paul; Lovász, László; Simmons, A.; Straus, E.G. , Dissection graphs of planar point sets. ,
Survey combin. Theory, Sympos. Colorado State Univ., Colorado 1971, 139- 149 (1973). , 05C20 52A10 05C99
Zbl 263.05108  •  Entringer, Roger C.; Erdös, Paul; Harner, C.C. , Some extremal properties concerning transitivity in graphs. ,
Period. Math. Hung. 3, 275-279 (1973). , 05C20 05C35
Zbl 264.05109  •  Erdös, Paul; Guy, R.K. , Crossing number problems. ,
Am. Math. Mon. 80, 52-58 (1973). , 05C10 05C35
Zbl 267.05104  •  Erdös, Paul; Fried, E.; Hajnal, András; Milner, E.C. , Some remarks on simple tournaments. ,
Algebra universalis 2, 238-245 (1972). [Reviewer: J.W.Moon] , 05C20
Zbl 269.05111  •  Sos, V.T.; Erdös, Paul; Brown, William G. , On the existence of triangulated spheres in 3-graphs, and related problems. ,
Period. Math. Hung. 3, 221-228 (1973). , 05C10 57M20 05C35
Zbl 284.05106  •  Andrasfai, B.; Erdös, Paul; Sos, V.T. , On the connection between chromatic number, maximal clique and minimal degree of a graph. ,
Discrete Math. 8, 205-218 (1974). [Reviewer: J.Mitchem] , 05C15 05C35
Zbl 289.05114  •  Erdös, Paul; Moon, J.W. , On sets of consistent arcs in a tournament. ,
Teor. Graf.; Pokryt. Ukladki Turniry, 160-162 (1974). , 05C20 05C35
Zbl 289.05124  •  Elliott, P.D.; Erdös, Paul , Some matching theorems. ,
Teor. Graf.; Pokryt. Ukladki Turniry, 7-11 (1974). , 05C99 05C30
Zbl 289.05128  •  Erdös, Paul; Renyi, Alfréd , On the existence of a factor of degree one of a connected random graph. ,
Teor. Graf.; Pokryt. Ukladki Turniry, 12-23 (1974). , 05C99 60C05
Zbl 311.05113  •  Bonnet, R.; Erdös, Paul , The chromatic index of an infinite complete hypergraph: A partition theorem. ,
Proc. 1rst Working Sem. Hypergraphs, Columbus 1972, Lecture Notes Math. 411, 54-60 (1974). [Reviewer: J.W.Moon] , 05C15 05C99
Zbl 312.05123  •  Erdös, Paul; Hajnal, András; Pósa, L. , Strong embeddings of graphs into colored graphs. ,
Infinite finite Sets, Colloq. Honour Paul Erdös, Keszthely 1973, Colloq. Math. Soc. Janos Bolyai 10, 585-595 (1975). [Reviewer: H.-J.Presia] , 05C99 05C15 05C10 04A20
Zbl 312.05126  •  Erdös, Paul , Some new applications of probability methods to combinatorial analysis and graph theory. ,
Proc. 5th southeast. Conf. Comb., Graph Theor., Comput.; Boca Raton 1974, 39-51 (1974). [Reviewer: R.C.Read] , 05C99 05Axx 05Cxx
Zbl 316.05110  •  Burr, Stefan A.; Erdös, Paul , On the magnitude of generalized Ramsey numbers for graphs. ,
Infinite finite Sets, Colloq. Honour Paul Erdös, Keszthely 1973, Colloq. Math. Soc. Janos Bolyai 10, 215-240 (1975). [Reviewer: J.E.Graver] , 05C15 05C35
Zbl 316.05111  •  Erdös, Paul; Simonovits, M.; Sos, V.T. , Anti-Ramsey theorems. ,
Infinite finite Sets, Colloq. Honour Paul Erdös, Keszthely 1973, Colloq. Math. Soc. Janos Bolyai 10, 633-643 (1975). [Reviewer: J.E.Graver] , 05C15 05C35
Zbl 323.05130  •  Erdös, Paul; Schönheim, J. , Edge decompositions of the complete graph into copies of a connected subgraph. ,
Proc. Conf. algebr. Aspects Comb., Semin. Toronto 1975, 271-278 (1975). , 05C99
Zbl 324.05124  •  Erdös, Paul; Graham, Ronald L. , On partition theorems for finite graphs. ,
Infinite finite Sets, Colloq. Honour Paul Erdös, Keszthely 1973, Colloq. Math. Soc. Janos Bolyai 10, 515-527 (1975). [Reviewer: M.S.Cheema] , 05C99 05C35
Zbl 337.05135  •  Bollobás, Béla; Daykin, D.E.; Erdös, Paul , Sets of independent edges of a hypergraph. ,
Q. J. Math., Oxf. II. Ser. 27, 25-32 (1976). [Reviewer: J.Plesnik] , 05C99
Zbl 344.05118  •  Chen, C.C.; Daykin, D.E.; Erdös, Paul , Subgraphs with all colours in a line-coloured graph. ,
Proc. 5th Br. comb. Conf., Aberdeen 1975, 101-112 (1976). [Reviewer: B.Toft] , 05C15 05C35
Zbl 344.05155  •  Bollobás, Béla; Erdös, Paul , Cliques in random graphs. ,
Math. Proc. Camb. Philos. Soc. 80, 419-427 (1976). [Reviewer: B.Zelinka] , 05C99 60C05 05C35
Zbl 346.05106  •  Erdös, Paul; Preiss, D. , Decomposition of spheres in Hilbert spaces. ,
Commentat. Math. Univ. Carol. 17, 791-795 (1976). [Reviewer: J.Fiamcik] , 05C15
Zbl 358.05027  •  Erdös, Paul; Kleitman, Daniel J.; Rothschild, B.L. , Asymptotic enumeration of Kn-free graphs. ,
Colloq. int. Teorie comb., Roma 1973, Tomo II, 19-27 (1976). [Reviewer: J.E.Graver] , 05C30 05C35
Zbl 374.05047  •  Erdös, Paul; Meir, A. , On total matching numbers and total covering numbers of complementary graphs. ,
Discrete Math. 19, 229-233 (1977). [Reviewer: L.Lesniak-Foster] , 05C99 05B40
Zbl 378.05032  •  Erdös, Paul; Wilson, Robin J. , On the chromatic index of almost all graphs. ,
J. Comb. Theory, Ser. B 23, 255-257 (1977). [Reviewer: J.Sedlácek] , 05C15
Zbl 397.05019  •  Erdös, Paul; Hechler, Stephen H.; Kainen, Paul , On finite superuniversal graphs. ,
Discrete Math. 24, 235-249 (1978). [Reviewer: R.L.Hemminger] , 05C10 05C15
Zbl 399.05041  •  Erdös, Paul; Spencer, Joel , Evolution of the n-cube. ,
Comput. Math. Appl. 5, 33-39 (1979). , 05C99 05C40 60C05 60D05
Zbl 406.05048  •  Trotter, William T.jun.; Erdös, Paul , When the Cartesian product of directed cycles is Hamiltonian. ,
J. Graph Theory 2, 137-142 (1978). , 05C45 05C99 11P81
Zbl 412.05033  •  Erdös, Paul , Problems and results in graph theory and combinatorial analysis. ,
Problemes combinatoires et theorie des graphes, Orsay 1976, Colloq. int. CNRS No.260, 127-129 (1978). , 05Cxx 05Axx 05-02 00A07
Zbl 451.05040  •  Erdös, Paul; Harary, Frank; Klawe, Maria , Residually-complete graphs. ,
Ann. Discrete Math. 6, 117-123 (1980). [Reviewer: R.L.Hemminger] , 05C99 05C35
Zbl 453.05050  •  Duke, Richard A.; Erdös, Paul , A problem on complements and disjoint edges in hypergraph. ,
Combinatorics, graph theory and computing, Proc. 11th southeast. Conf., Boca Raton/Florida 1980, Vol. I, Congr. Numerantium 28, 369-375 (1980). [Reviewer: L.Zaremba] , 05C65 05C70 05C55
Zbl 457.05024  •  Erdös, Paul , Problems and results in graph theory and combinatorial analysis. ,
Graph theory and related topics, Proc. Conf. Honour W. T. Tutte, Waterloo/Ont. 1977, 153-163 (1979). , 05Cxx 05-06 05Axx 00A07
Zbl 462.05057  •  Erdös, Paul; Lovász, László; Spencer, Joel , Strong independence of graphcopy functions. ,
Graph theory and related topics, Proc. Conf. Honour W. T. Tutte, Waterloo/Ont. 1977, 165-172 (1979). [Reviewer: E.Palmer] , 05C99
Zbl 463.05036  •  Erdös, Paul , Problems and results in graph theory. ,
The theory and applications of graphs, 4th int. Conf., Kalamazoo/ Mich. 1980, 331-341 (1981). , 05Cxx 05-06 00A07
Zbl 465.05058  •  Erdös, Paul; Faudree, Ralph J.; Rousseau, C.C.; Schelp, R.H. , Graphs with certain families of spanning trees. ,
J. Comb. Theory, Ser. B 32, 162-170 (1982). , 05C75 05C05 05C55
Zbl 466.05031  •  Erdös, Paul; Simonovits, M. , On the chromatic number of geometric graphs. ,
Ars Comb. 9, 229-246 (1980). [Reviewer: M.Walter] , 05C15 05C10
Zbl 469.05032  •  Erdös, Paul; Rubin, Arthur L.; Taylor, Herbert , Choosability in graphs. ,
Combinatorics, graph theory and computing, Proc. West Coast Conf., Arcata/Calif. 1979, 125-157 (1980). [Reviewer: J.Dinitz] , 05C15
Zbl 479.05054  •  Erdös, Paul; Schuster, S. , Existence of complementary graphs with specified independence numbers. ,
The theory and applications of graphs, 4th int. Conf., Kalamazoo/ Mich. 1980, 343-349 (1981). [Reviewer: R.Faudree] , 05C70 05C35 05C55
Zbl 483.05053  •  Chung, F.R.K.; Erdös, Paul; Graham, Ronald L. , On the product of the point and line covering numbers of a graph. ,
Combinatorial mathematics, 2nd int. Conf., New York 1978, Ann. New York Acad. Sci. 319, 597-602 (1979). [Reviewer: J.C.Bermond] , 05C70 05C35
Zbl 485.05052  •  Erdös, Paul , On the covering of the vertices of a graph by cliques. ,
J. Math. Res. Expo. 1982, No.1, 93-96 (1982). [Reviewer: J.-H.Tian] , 05C70 05C30 05C35
Zbl 491.05049  •  Chung, F.R.K.; Erdös, Paul; Graham, Ronald L. , Minimal decompositions of graphs into mutually isomorphic subgraphs. ,
Combinatorica 1, 13-24 (1981). [Reviewer: N.Wormald] , 05C70 05C35
Zbl 493.05048  •  Chung, F.R.K.; Erdös, Paul; Graham, Ronald L. , Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs. ,
J. Comb. Theory, Ser. A 32, 241-251 (1982). [Reviewer: D.de Caen] , 05C65
Zbl 493.05049  •  Erdös, Paul; Hobbs, Arthur M.; Payan, C. , Disjoint cliques and disjoint maximal independent sets of vertices in graphs. ,
Discrete Math. 42, 57-61 (1982). [Reviewer: M.Sudolský] , 05C70 05C35
Zbl 501.05033  •  Erdös, Paul; Hajnal, András; Szemeredi, E. , On almost bipartite large chromatic graphs. ,
Ann. Discrete Math. 12, 117-123 (1982). [Reviewer: O.Frank] , 05C15
Zbl 504.05052  •  Erdös, Paul; Fajtlowicz, Siemion , On the conjecture of Hajos. ,
Combinatorica 1, 141-143 (1981). [Reviewer: K.Schürger] , 05C80 05C15 60C05
Zbl 511.05049  •  Erdös, Paul; Sós, Vera T. , On Ramsey - Turan type theorems for hypergraphs. ,
Combinatorica 2, 289-295 (1982). [Reviewer: L.Zaremba] , 05C65 05C35 05C55
Zbl 515.05048  •  Duke, Richard; Erdös, Paul , Subgraphs in which each pair of edges lies in a short common cycle. ,
Combinatorics, graph theory and computing, Proc. 13th Southeast. Conf., Boca Raton 1982, Congr. Numerantium 35, 253-260 (1982). [Reviewer: W.G.Brown] , 05C65 05C35 05C38
Zbl 522.05070  •  Erdös, Paul; Nesetril, Jaroslav; Rödl, Vojtech , On some problems related to partitions of edges of a graph. ,
Graphs and other combinatorial topics, Proc. 3rd Czech. Symp., Prague 1982, Teubner-Texte Math. 59, 54-63 (1983). , 05C99 05-06 05C55
Zbl 529.05044  •  Erdös, Paul; Hindman, N. , Enumeration of intersecting families. ,
Discrete Math. 48, 61-65 (1984). [Reviewer: P.Komjaáth] , 05C65 05A05 05C35
Zbl 529.05053  •  Erdös, Paul; Palmer, Edgar M.; Robinson, Robert W. , Local connectivity of a random graph. ,
J. Graph Theory 7, 411-417 (1983). [Reviewer: W.Schlee. \end] , 05C80 05C40 60C05
Zbl 535.05049  •  Erdös, Paul; Palka, Z. , Trees in random graphs. ,
Discrete Math. 46, 145-150 (1983); addendum ibid 48, 331 (1984). [Reviewer: J.Mitchem] , 05C80 05C05 60C05
Zbl 546.05002  •  Erdös, Paul , On some problems in graph theory, combinatorial analysis and combinatorial number theory. ,
Graph theory and combinatorics, Proc. Conf. Hon. P. Erdös, Cambridge 1983, 1-17 (1984). , 05Cxx 00A07 05A05 11B75
Zbl 549.05029  •  Eggleton, R.B.; Erdös, Paul; Skilton, D.K. , Colouring the real line. ,
J. Comb. Theory, Ser. B 39, 86-100 (1985); Errata ibid. 41, 139 (1986). [Reviewer: P.Erdös] , 05C15 05A17
Zbl 558.05026  •  Barak, Amnon B.; Erdös, Paul , On the maximal number of strongly independent vertices in a random acyclic directed graph. ,
SIAM J. Algebraic Discrete Methods 5, 508-514 (1984). [Reviewer: O.Frank] , 05C20 05C80 60C05 60F20
Zbl 559.05038  •  Duke, Richard; Erdös, Paul; Rödl, Vojtech , More results on subgraphs with many short cycles. ,
Combinatorics, graph theory and computing, Proc. 15th Southeast. Conf., La. State Univ. 1984, Congr. Numerantium 43, 295-300 (1984). [Reviewer: L.Lesniak] , 05C38
Zbl 566.05029  •  Erdös, Paul; Hajnal, András , Chromatic number of finite and infinite graphs and hypergraphs. ,
Discrete Math. 53, 281-285 (1985). [Reviewer: I.Tomescu] , 05C15 05C35 05-02
Zbl 569.05023  •  Brown, William G.; Erdös, Paul; Simonovits, M. , Inverse extremal digraph problems. ,
Finite and infinite sets, 6th Hung. Combin. Colloq., Eger/Hung. 1981, Vol. I, Colloq. Math. Soc. János Bolyai 37, 119-156 (1984). [Reviewer: G.Chaty] , 05C20 05C35 05C50
Zbl 569.05041  •  Erdös, Paul; Nesetril, J.; Rödl, Vojtech , Selectivity of hypergraphs. ,
Finite and infinite sets, 6th Hung. Combin. Colloq., Eger/Hung. 1981, Vol. I, Colloq. Math. Soc. János Bolyai 37, No.1, 265-284 (1984). [Reviewer: L.Zaremba] , 05C65
Zbl 573.05021  •  Erdös, Paul , Problems and results on chromatic numbers in finite and infinite graphs. ,
Graph theory with applications to algorithms and computer science, Proc. 5th Int. Conf., Kalamazoo/Mich. 1984, 201-213 (1985). [Reviewer: I.Tomescu] , 05C15 05-02 00A07
Zbl 576.05019  •  Erdös, Paul; West, Douglas B. , A note on the interval number of a graph. ,
Discrete Math. 55, 129-133 (1985). [Reviewer: M.Koman] , 05C10 60C05
Zbl 581.10029  •  Alon, Noga; Erdös, Paul , An application of graph theory to additive number theory. ,
Eur. J. Comb. 6, 201-203 (1985). [Reviewer: I.Anderson] , 11B83 11P99 05C65
Zbl 591.05030  •  Erdös, Paul; Füredi, Z.; Hajnal, András; Komjáth, P.; Rödl, Vojtech; Seress, Á. , Coloring graphs with locally few colors. ,
Discrete Math. 59, 21-34 (1986). [Reviewer: I.Tomescu] , 05C15
Zbl 593.05038  •  Erdös, Paul; Frankl, P.; Rödl, Vojtech , The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. ,
Graphs Comb. 2, 113-121 (1986). [Reviewer: E.M.Palmer] , 05C30 05C65
Zbl 596.05027  •  El-Zahar, M.; Erdös, Paul , On the existence of two non-neighboring subgraphs in a graph. ,
Combinatorica 5, 295-300 (1985). [Reviewer: J.Fiamcik] , 05C15 05C35
Zbl 622.05042  •  Clark, Brent N.; Colbourn, Charles J.; Erdös, Paul , A conjecture on dominating cycles. ,
Combinatorics, graph theory and computing, Proc. 16th Southeast. Conf., Boca Raton/Fla. 1985, Congr. Numerantium 47, 189-197 (1985). , 05C38 05C99
Zbl 626.05045  •  Erdös, Paul; Ordman, Edward T.; Zalcstein, Yechezkel , Bounds on threshold dimension and disjoint threshold coverings. ,
SIAM J. Algebraic Discrete Methods 8, 151-154 (1987). , 05C70
Zbl 641.05046  •  Alavi, Yousef; Boals, Alfred J.; Chartrand, Gary; Erdös, Paul; Oellermann, Ortrud R. , The ascending subgraph decomposition problem. ,
Combinatorics, graph theory, and computing, Proc. 18th Southeast. Conf., Boca Raton/Fl. 1987, Congr. Numerantium 58, 7-14 (1987). , 05C70
Zbl 647.05034  •  Erdös, Paul; Laskar, Renu , A note on the size of a chordal subgraph. ,
Combinatorics, graph theory and computing, Proc. 16th Southeast. Conf., Boca Raton/Fla. 1985, Congr. Numerantium 48, 81-86 (1985). , 05C38 05C35
Zbl 655.05059  •  Erdös, Paul; Goldberg, Mark; Pach, János; Spencer, Joel , Cutting a graph into two dissimilar halves. ,
J. Graph Theory 12, No.1, 121-131 (1988). , 05C99
Zbl 657.05048  •  Erdös, Paul; Faudree, Ralph J.; Gyárfás, A.; Schelp, R.H. , Cycles in graphs without proper subgraphs of minimum degree 3. ,
Ars Comb. 25B, 195-201 (1988). [Reviewer: L.Lesniak] , 05C38
Zbl 659.05075  •  Caccetta, Louis; Erdös, Paul; Vijayan, K. , Graphs with unavoidable subgraphs with large degrees. ,
J. Graph Theory 12, No.1, 17-27 (1988). [Reviewer: B.Andrasfai] , 05C75 05C38
Zbl 659.05079  •  Erdös, Paul; Godsil, C.D.; Krantz, S.G.; Parsons, T.D. , Intersection graphs for families of balls in Rn. ,
Eur. J. Comb. 9, No.5, 501-506 (1988). [Reviewer: R.C.Entringer] , 05C99
Zbl 665.05043  •  Alavi, Yousef; Chartrand, Gary; Chung, F.R.K.; Erdös, Paul; Graham, Ronald L.; Oellermann, Ortrud R. , Highly irregular graphs. ,
J. Graph Theory 11, No.2, 235-249 (1987). [Reviewer: E.Maehle] , 05C75 05C30 05C05
Zbl 669.05046  •  Alavi, Yousef; Boals, Alfred J.; Chartrand, Gary; Oellermann, Ortrud R.; Erdös, Paul , K-path irregular graphs. ,
Combinatorics, graph theory, and computing, Proc. 19th Southeast. Conf., Boca Raton/Fla. 1988, Congr. Numerantium 65, 201-210 (1988). , 05C38 05C99
Zbl 674.05056  •  Erdös, Paul; Kennedy, J.W. , k-connectivity in random graphs. ,
Eur. J. Comb. 8, 281-286 (1987). , 05C80 05C40
Zbl 677.05028  •  Thomassen, Carsten; Erdös, Paul; Alavi, Yousef; Malde, Paresh J.; Schwenk, Allen J. , Tight bounds on the chromatic sum of a connected graph. ,
J. Graph Theory 13, No.3, 353-357 (1989). [Reviewer: U.Baumann] , 05C15
Zbl 677.05053  •  Erdös, Paul; Pach, János; Spencer, Joel , On the mean distance between points of a graph. ,
Graph theory, 250th Anniv. Conf., Lafayette/Indiana 1986, Congr. Numerantium 64, 121-124 (1988). [Reviewer: J.Rosicky] , 05C40
Zbl 679.05061  •  Alavi, Yousef; Malde, Paresh J.; Schwenk, Allen J.; Erdös, Paul , The vertex independence sequence of a graph is not constrained. ,
Combinatorics, graph theory, and computing, Proc. 18th Southeast. Conf., Boca Raton/Fl. 1987, Congr. Numerantium 58, 15-23 (1987). [Reviewer: R.C.Read] , 05C75 05C99
Zbl 683.05020  •  Erdös, Paul; Lovász, László; Vesztergombi, K. , The chromatic number of the graph of large distances. ,
Combinatorics, Proc. 7th Hung. Colloq., Eger/Hung. 1987, Colloq. Math. Soc. János Bolyai 52, 547-551 (1988). [Reviewer: I.Tomescu] , 05C15
Zbl 684.05043  •  Erdös, Paul; Hell, P.; Winkler, P. , Bandwidth versus bandsize. ,
Graph theory in memory of G. A. Dirac, Pap. Meet., Sandbjerg/Den. 1985, Ann. Discrete Math. 41, 117-129 (1989). [Reviewer: R.Bodendiek] , 05C99 05C80
Zbl 691.05053  •  Erdös, Paul; Evans, Anthony B. , Representations of graphs and orthogonal Latin square graphs. ,
J. Graph Theory 13, No.5, 593-595 (1989). , 05C99 05B15
Zbl 694.05031  •  Erdös, Paul; Lovász, László; Vesztergombi, K. , On the graph of large distances. ,
Discrete Comput. Geom. 4, No.6, 541-549 (1989). [Reviewer: B.Zelinka] , 05C15 05C38 52A10
Zbl 698.05033  •  Eggleton, R.B.; Erdös, Paul; Skilton, D.K. , Colouring prime distance graphs. ,
Graphs Comb. 6, No.1, 17-32 (1990). [Reviewer: K.Engel] , 05C15 11B75
Zbl 703.05044  •  Erdös, Paul; Pach, János; Pyber, L. , Isomorphic subgraphs in a graph. ,
Combinatorics, Proc. 7th Hung. Colloq., Eger/Hung. 1987, Colloq. Math. Soc. János Bolyai 52, 553-556 (1988). [Reviewer: K.R.Parthasarathy] , 05C65 05C70 05C60
Zbl 704.05020  •  Erdös, Paul; Kubicka, Ewa; Schwenk, Allen J. , Graphs that require many colors to achieve their chromatic sum. ,
Combinatorics, graph theory, and computing, Proc. 20th Southeast Conf., Boca Raton/FL (USA) 1989, Congr. Numerantium 71, 17-28 (1990). [Reviewer: B.Toft] , 05C15 05C35
Zbl 704.05039  •  Erdös, Paul; Faudree, Ralph J.; Gould, R.J.; Gyárfás, A.; Rousseau, C.; Schelp, R.H. , Monochromatic coverings in colored complete graphs. ,
Combinatorics, graph theory, and computing, Proc. 20th Southeast Conf., Boca Raton/FL (USA) 1989, Congr. Numerantium 71, 29-38 (1990). [Reviewer: B.Toft] , 05C70
Zbl 708.05021  •  Erdös, Paul; Hare, W.R.; Hedetniemi, S.T.; Laskar, R. , On the equality of the Grundy and ochromatic numbers of a graph. ,
J. Graph Theory 11, No.2, 157-159 (1987). , 05C15
Zbl 708.05057  •  Erdös, Paul; Faudree, Ralph J.; Gyárfás, A.; Schelp, R.H. , Domination in colored complete graphs. ,
J. Graph Theory 13, No.6, 713-718 (1989). [Reviewer: D.Lick] , 05C99 68R10
Zbl 716.05023  •  Erdös, Paul , Some new and old problems on chromatic graphs. ,
Combinatorics and applications, Proc. Semin. in Honour of S. S. Shrikhande, Indian Statist. Inst., Calcutta/India 1982, 118-126 (1984). , 05C15 05-02 00A07
Zbl 721.05020  •  Erdös, Paul; Gimbel, John; Straight, H.Joseph , Chromatic number versus chromatic number in graphs with bounded clique number. ,
Eur. J. Comb. 11, No.3, 235-240 (1990). [Reviewer: B.Toft (Odense)] , 05C15 05C35
Zbl 725.05062  •  Chung, F.R.K.; Erdös, Paul , On unavoidable hypergraphs. ,
J. Graph Theory 11, No.2, 251-263 (1987). , 05C65
Zbl 737.05001  •  Erdös, Paul , On some of my favourite problems in graph theory and block designs. ,
Matematiche 45, No.1, 61-73 (1990). , 05-02 00A07 05Cxx 05Bxx
Zbl 743.05047  •  Erdös, Paul; Gimbel, John; Kratsch, Dieter , Some extremal results in cochromatic and dichromatic theory. ,
J. Graph Theory 15, No.6, 579-585 (1991). [Reviewer: I.Tomescu (Bucuresti)] , 05C80 05C15 05C35 05C20
Zbl 745.05043  •  Burr, Stefan A.; Erdös, Paul , Extremal non-Ramsey graphs. ,
Graph theory, combinatorics, algorithms, and applications, Proc. 2nd Int. Conf., San Francisco/CA (USA) 1989, 42-66 (1991). [Reviewer: J.E.Graver] , 05C75 05C55 05C35
Zbl 751.05070  •  Chartrand, Gary; Erdös, Paul; Kubicki, Grzegorz , Absorbing common subgraphs. ,
Graph theory, combinatorics, algorithms, and applications, Proc. 2nd Int. Conf., San Francisco/CA (USA) 1989, 96-105 (1991). [Reviewer: T.Andreae (Hamburg)] , 05C60
Zbl 752.05028  •  Erdös, Paul; Fajtlowicz, Siemion; Staton, William , Degree sequences in triangle-free graphs. ,
Discrete Math. 92, No.1-3, 85-88 (1991). [Reviewer: C.Chaty (Paris)] , 05C15 05C99
Zbl 760.05025  •  Erdös, Paul , On some of my favourite problems in various branches of combinatorics. ,
Combinatorics, graphs and complexity, Proc. 4th Czech. Symp., Prachatice/Czech. 1990, Ann. Discrete Math. 51, 69-79 (1992). , 05Cxx 00A07 05Axx
Zbl 764.05077  •  Alavi, Yousef; Behzad, Mehdi; Erdös, Paul; Lick, Don R. , Double vertex graphs. ,
J. Comb. Inf. Syst. Sci. 16, No.1, 37-50 (1991). , 05C75 05C45 05C40
Zbl 766.05060  •  Erdös, Paul; Füredi, Zoltán; Tuza, Zsolt , Saturated r-uniform hypergraphs. ,
Discrete Math. 98, No.2, 95-104 (1991). , 05C65 05C35
Zbl 766.05062  •  Erdös, Paul; Gyárfás, A.; Pyber, L. , Vertex coverings by monochromatic cycles and trees. ,
J. Comb. Theory, Ser. B 51, No.1, 90-95 (1991). [Reviewer: R.C.Entringer (Albuquerque)] , 05C70 05C38 05C05 05C15
Zbl 766.05063  •  Erdös, Paul; Gallai, Tibor; Tuza, Zsolt , Covering the cliques of a graph with vertices. ,
Discrete Math. 108, No.1-3, 279-289 (1992). [Reviewer: R.C.Entringer (Albuquerque)] , 05C70 05C35 05C85
Zbl 767.05089  •  Erdös, Paul; Schuster, Seymour , Existence of complementary graphs having specified edge domination numbers. ,
J. Comb. Inf. Syst. Sci. 16, No.1, 7-10 (1991). , 05C99
Zbl 782.05072  •  Bollobás, Béla; Erdös, Paul; Spencer, Joel; West, Douglas B. , Clique coverings of the edges of a random graph. ,
Combinatorica 13, No.1, 1-5 (1993). [Reviewer: M.Truszczynski (Lexington)] , 05C80 05C70
Zbl 791.05037  •  Erdös, Paul; Tuza, Zsolt , Rainbow subgraphs in edge-colorings of complete graphs. ,
Gimbel, John (ed.) et al., Quo vadis, graph theory? A source book for challenges and directions. Amsterdam: North-Holland, Ann. Discrete Math. 55, 81-88 (1993). , 05C15
Zbl 791.05038  •  Erdös, Paul; Gimbel, John , Some problems and results in cochromatic theory. ,
Gimbel, John (ed.) et al., Quo vadis, graph theory? A source book for challenges and directions. Amsterdam: North-Holland, Ann. Discrete Math. 55, 261-264 (1993). [Reviewer: L.Lesniak Foster (Madison)] , 05C15 00A07
Zbl 792.60009  •  Erdös, Paul; Luczak, Tomasz , Changes of leadership in a random graph process. ,
Random Struct. Algorithms 5, No.1, 243-252 (1994). , 60C05 05C80
Zbl 817.05056  •  Erdös, Paul; Luczak, Tomasz; Spencer, Joel , Subgraphs of large minimal degree. ,
Frieze, Alan (ed.) et al., Random graphs. Volume 2. Based on papers presented at the fourth international seminar on random graphs and probabilistic methods in combinatorics, held in Poznan, Poland, August 7-11, 1989. Chichester: Wiley, Wiley-Interscience Publication. 59-66 (1992). , 05C80
Zbl 820.05054  •  Erdös, Paul; Suen, Stephen; Winkler, Peter , On the size of a random maximal graph. ,
Random Struct. Algorithms 6, No.2-3, 309-318 (1995). [Reviewer: A.Rucinski (Poznan)] , 05C80 05C55
Zbl 829.05033  •  Chen, Hang; Schwenk, Allen J.; Erdös, Paul , Tournaments that share several common moments with their complements. ,
Bull. Inst. Comb. Appl. 4, 65-89 (1992). , 05C20 11B75
Zbl 829.05055  •  Alavi, Yousef; Liu, Jiuqiang; McCanna, Joseph; Erdös, Paul , On the minimum size of graphs with a given bandwidth. ,
Bull. Inst. Comb. Appl. 6, 22-32 (1992). , 05C78 68R10 05C35
Zbl 835.05036  •  Chen, Guantao; Erdös, Paul; Staton, William , Proof of a conjecture of Bollobás on nested cycles. ,
J. Comb. Theory, Ser. B 66, No.1, 38-43 (1996). [Reviewer: W.Staton (Mississippi)] , 05C38 05C35
Zbl 840.05085  •  Erdös, Paul; Gimbel, John , A note on the largest H-free subgraph in a random graph. ,
Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley & Sons Ltd. Wiley-Interscience Publication. 435-437 (1991). , 05C80
Zbl 840.05093  •  Erdös, Paul; Jacobson, M.S.; Lehel, J. , Graphs realizing the same degree sequences and their respective clique numbers. ,
Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley & Sons Ltd. Wiley-Interscience Publication. 439-449 (1991). , 05C99
Zbl 840.05094  •  Erdös, Paul , Problems and results in combinatorial analysis and combinatorial number theory. ,
Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley & Sons Ltd. Wiley-Interscience Publication. 397-406 (1991). [Reviewer: A.N.Philippou (MR 93g: 05136)] , 05C99 11B75 00A07
Zbl 842.05080  •  Erdös, Paul; Janson, Svante; Luczak, Tomasz; Spencer, Joel , A note on triangle-free graphs. ,
Aldous, David (ed.) et al., Random discrete structures. Based on a workshop held November 15-19, 1993 at IMA, University of Minnesota, Minneapolis, MN, USA. Berlin: Springer-Verlag, IMA Vol. Math. Appl. 76, 117-119 (1996). [Reviewer: G.L.McColm (Tampa)] , 05C80
Zbl 846.05025  •  Erdös, Paul , Some of my favourite problems on cycles and colourings. ,
Tatra Mt. Math. Publ. 9, 7-9 (1996). , 05C15 05C38 00A07
Zbl 848.05049  •  Erdös, Paul; Fon-Der-Flaas, D.; Kostochka, A.V.; Tuza, Zs. , Small transversals in uniform hypergraphs. ,
Sib. Adv. Math. 2, No.1, 82-88 (1992). , 05C65
Zbl 849.05021  •  Erdös, Paul; Füredi, Z.; Loebl, M.; Sós, V.T. , Discrepancy of trees. ,
Stud. Sci. Math. Hung. 30, No.1-2, 47-57 (1995). [Reviewer: K.Engel (Rostock)] , 05C05 05C55 05D10 05C35
Zbl 849.11024  •  Erdös, Paul , Some of my recent problems in combinatorial number theory, geometry and combinatorics. ,
Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley, 335-349 (1995). [Reviewer: N.Hegyvari (Budapest)] , 11B75 52C10 00A07 05C99 05-02 11-02 52-02 05A99
Zbl 857.05027  •  Erdös, Paul; Hamburger, Peter; Pippert, Raymond E.; Weakley, William D. , Hypercube subgraphs with minimal detours. ,
J. Graph Theory 23, No.2, 119-128 (1996). [Reviewer: F.Plastria (Brussels)] , 05C12 05C35 68R10
Zbl 857.05077  •  Erdös, Paul; Gallai, Tibor; Tuza, Zsolt , Covering and independence in triangle structures. ,
Discrete Math. 150, No.1-3, 89-101 (1996). [Reviewer: A.Vince (Gainesville)] , 05C70 05C35 05C55
Zbl 871.05054  •  Erdös, Paul , Some recent problems and results in graph theory. ,
Discrete Math. 164, No.1-3, 81-85 (1997). [Reviewer: E.J.F.Primrose (Leicester)] , 05C99 00A07 05D99
Zbl 876.05080  •  Erdös, Paul; Pyber, L. , Covering a graph by complete bipartite graphs. ,
Discrete Math. 170, No.1-3, 249-251 (1997). , 05C70
Zbl 881.05044  •  Chen, Guantao; Erdös, Paul; Gyárfás, András; Schelp, R.H. , A class of edge critical 4-chromatic graphs. ,
Graphs Comb. 13, No.2, 139-146 (1997). [Reviewer: D.Cvetkovic (Beograd)] , 05C15
Zbl 980.26449 DE011462273  •  Erdös, Paul; Nesetril, Jaroslav; Rödl, Vojtech , A remark on Pisier type theorems. ,
Congr. Numerantium 113, 101-109 (1996). , 05C65

© 1998 European Mathematical Society & FIZ Karlsruhe & Springer-Verlag

Books Problems Set Theory Combinatorics Extremal Probl/Ramsey Th.
Graph Theory Add.Number Theory Mult.Number Theory Analysis Geometry
Probabability Personalia About Paul Erdös Publication Year Home Page