Paul Erdös

March 26, 1913 - September 20, 1996

	2006
157		Paul Erdös, A. Meir, Vera T. Sós, P. Turán: On some applications of graph theory, I. Discrete Mathematics 306(10-11): 853-866 (2006)
156		Paul Erdös, Daniel J. Kleitman: Extremal problems among subsets of a set. Discrete Mathematics 306(10-11): 923-931 (2006)
	2003
155		Paul Erdös, Stephen T. Hedetniemi, Renu Laskar, Geert C. E. Prins: On the equality of the partial Grundy and upper ochromatic numbers of graphs. Discrete Mathematics 272(1): 53-64 (2003)
154		Richard A. Duke, Paul Erdös, Vojtech Rödl: On large intersecting subfamilies of uniform setfamilies. Random Struct. Algorithms 23(4): 351-356 (2003)
	2002
153		Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Random induced graphs. Discrete Mathematics 248(1-3): 249-254 (2002)
	2001
152		Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel: Edge disjoint monochromatic triangles in 2-colored graphs. Discrete Mathematics 231(1-3): 135-141 (2001)
	1999
151		Paul Erdös, Grigori Kolesnik: Prime power divisors of binomial coefficients. Discrete Mathematics 200(1-3): 101-117 (1999)
150		Paul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy: Greedy algorithm, arithmetic progressions, subset sums and divisibility. Discrete Mathematics 200(1-3): 119-135 (1999)
149		Paul Erdös, Janice L. Malouf, J. L. Selfridge, Esther Szekeres: Subsets of an interval whose product is a power. Discrete Mathematics 200(1-3): 137-147 (1999)
148		Paul Erdös, Christian Mauduit, András Sárközy: On arithmetic properties of integers with missing digits II: Prime factors. Discrete Mathematics 200(1-3): 149-164 (1999)
147		Paul Erdös, Péter P. Pálfy: On the orders of directly indecomposable groups. Discrete Mathematics 200(1-3): 165-179 (1999)
146		Paul Erdös, Gerald Tenenbaum: Ensembles de multiples de suites finies. Discrete Mathematics 200(1-3): 181-203 (1999)
145		John Adrian Bondy, Paul Erdös, Siemion Fajtlowicz: Graphs of diameter two with no 4-circuits. Discrete Mathematics 200(1-3): 21-25 (1999)
144		Marc Deléglise, Paul Erdös, Jean-Louis Nicolas: Sur les ensembles représentés par les partitions d'un entier n1. Discrete Mathematics 200(1-3): 27-48 (1999)
143		Jean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi: On a question about sum-free sequences. Discrete Mathematics 200(1-3): 49-54 (1999)
142		Béla Bollobás, Paul Erdös, Amites Sarkar: Extremal graphs for weights. Discrete Mathematics 200(1-3): 5-19 (1999)
141		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: The number of cycle lengths in graphs of given minimum degree and girth. Discrete Mathematics 200(1-3): 55-60 (1999)
140		Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós: Induced subgraphs of given sizes. Discrete Mathematics 200(1-3): 61-77 (1999)
139		Paul Erdös, András Gyárfás: Split and balanced colorings of complete graphs. Discrete Mathematics 200(1-3): 79-86 (1999)
138		Paul Erdös, Richard Roxby Hall: On the angular distribution of Gaussian integers with fixed norm. Discrete Mathematics 200(1-3): 87-94 (1999)
137		Paul Erdös, Gergely Harcos, János Pach: Popular distances in 3-space. Discrete Mathematics 200(1-3): 95-99 (1999)
	1998
136		Béla Bollobás, Paul Erdös: Graphs of Extremal Weights. Ars Comb. 50: (1998)
135		Paul Erdös, András Gyárfás, Miklós Ruszinkó: How to decrease the diameter of triangle-free graphs. Combinatorica 18(4): 493-501 (1998)
	1997
134		Paul Erdös, András Gyárfás: A Variant of the Classical Ramsey Problem. Combinatorica 17(4): 459-467 (1997)
133		Paul Erdös, Peter C. Fishburn: Minimum Planar Sets with Maximum Equidistance Counts. Comput. Geom. 7: 207-218 (1997)
132		Paul Erdös: Some recent problems and results in graph theory. Discrete Mathematics 164(1-3): 81-85 (1997)
131		Paul Erdös: Some old and new problems in various branches of combinatorics. Discrete Mathematics 165-166: 227-231 (1997)
130		Paul Erdös, László Pyber: Covering a graph by complete bipartite graphs. Discrete Mathematics 170(1-3): 249-251 (1997)
129		Paul Erdös, Peter C. Fishburn: Distinct distances in finite planar sets. Discrete Mathematics 175(1-3): 97-132 (1997)
128		Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa: The size of the largest bipartite subgraphs. Discrete Mathematics 177(1-3): 267-271 (1997)
127		Paul Erdös, Gábor N. Sárközy: On cycles in the coprime graph of integers. Electr. J. Comb. 4(2): (1997)
126		Walter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer: Intersection Statements for Systems of Sets. J. Comb. Theory, Ser. A 79(1): 118-132 (1997)
125		Neil J. Calkin, Paul Erdös, Craig A. Tovey: New Ramsey Bounds from Cyclic Graphs of Prime Order. SIAM J. Discrete Math. 10(3): 381-387 (1997)
	1996
124		Paul Erdös, Tibor Gallai, Zsolt Tuza: Covering and independence in triangle structures. Discrete Mathematics 150(1-3): 89-101 (1996)
123		Paul Erdös, András Gyárfás, Tomasz Luczak: Graphs in which each C4 spans K4. Discrete Mathematics 154(1-3): 263-268 (1996)
122		Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton: Sizes of graphs with induced subgraphs of large maximum degree. Discrete Mathematics 158(1-3): 283-286 (1996)
121		Paul Erdös, Peter C. Fishburn: Maximum planar sets that determine k distances. Discrete Mathematics 160(1-3): 115-125 (1996)
120		Paul Erdös, Zsolt Tuza, Pavel Valtr: Ramsey-remainder. Eur. J. Comb. 17(6): 519-532 (1996)
119		Guantao Chen, Paul Erdös, William Staton: Proof of a Conjecture of Bollob's on Nested Cycles. J. Comb. Theory, Ser. B 66(1): 38-43 (1996)
118		Paul Erdös, Mordechai Lewin: d-complete sequences of integers. Math. Comput. 65(214): 837-840 (1996)
	1995
117		Paul Erdös, George B. Purdy: Two Combinatorial Problems in the Plane. Discrete & Computational Geometry 13: 441-443 (1995)
116		Paul Erdös, Peter C. Fishburn: Multiplicities of Interpoint Distances in Finite Planar Sets. Discrete Applied Mathematics 60(1-3): 141-147 (1995)
115		Paul Erdös, Peter C. Fishburn: Intervertex Distances in Convex Polygons. Discrete Applied Mathematics 60(1-3): 149-158 (1995)
114		Arie Bialostocki, Paul Erdös, Hanno Lefmann: Monochromatic and zero-sum sets of nondecreasing diameter. Discrete Mathematics 137(1-3): 19-34 (1995)
113		Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton: Degree sequence and independence in K(4)-free graphs. Discrete Mathematics 141(1-3): 285-290 (1995)
112		Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson: Extremal Graphs for Intersecting Triangles. J. Comb. Theory, Ser. B 64(1): 89-100 (1995)
111		Paul Erdös, Stephen Suen, Peter Winkler: On the Size of a Random Maximal Graph. Random Struct. Algorithms 6(2/3): 309-318 (1995)
110		Paul Erdös, Vojtech Rödl: Covering of r-Graphs by Complete r-Partite Subgraphs. Random Struct. Algorithms 6(2/3): 319-322 (1995)
	1994
109		Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman: Crossing Families. Combinatorica 14(2): 127-134 (1994)
108		Paul Erdös, András Gyárfás, Tomasz Luczak: Independet Transversals in Sparse Partite Hypergraphs. Combinatorics, Probability & Computing 3: 293-296 (1994)
107		Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi: Turán-Ramsey Theorems and Kp-Independence Numbers. Combinatorics, Probability & Computing 3: 297-325 (1994)
106		Paul Erdös, Peter C. Fishburn: A Postscript on Distances in Convex n-Gons. Discrete & Computational Geometry 11: 111-117 (1994)
105		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau: Extremal problems and generalized degrees. Discrete Mathematics 127(1-3): 139-152 (1994)
104		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: A local density condition for triangles. Discrete Mathematics 127(1-3): 153-161 (1994)
103		Paul Erdös: Problems and results in discrete mathematics. Discrete Mathematics 136(1-3): 53-73 (1994)
102		Paul Erdös, András Sárközy, Vera T. Sós: On additive properties of general sequences. Discrete Mathematics 136(1-3): 75-99 (1994)
101		Paul Erdös, Tomasz Luczak: Change of Leadership in a Random Graph Process. Random Struct. Algorithms 5(1): 243-252 (1994)
	1993
100		Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West: Clique coverings of the edges of a random graph. Combinatorica 13(1): 1-5 (1993)
99		Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi: Turán-Ramsey theorems and simple asymptotically extremal structures. Combinatorica 13(1): 31-56 (1993)
98		Paul Erdös, L. Bruce Richmond: On graphical partitions. Combinatorica 13(1): 57-63 (1993)
97		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Ramsey Size Linear Graphs. Combinatorics, Probability & Computing 2: 389-399 (1993)
96		Paul Erdös, Endre Makai, János Pach: Nearly Equal Distances in the Plane. Combinatorics, Probability & Computing 2: 401-408 (1993)
95		Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein: Clique Partitions of Chordal Graphs. Combinatorics, Probability & Computing 2: 409-415 (1993)
94		Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa: The grid revisted. Discrete Mathematics 111(1-3): 189-196 (1993)
93		Paul Erdös, Cecil C. Rousseau: The size Ramsey number of a complete bipartite graph. Discrete Mathematics 113(1-3): 259-262 (1993)
92		Paul Erdös, Fred Galvin: Monochromatic infinite paths. Discrete Mathematics 113(1-3): 59-70 (1993)
91		Paul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp: Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs. Eur. J. Comb. 14(3): 183-189 (1993)
90		Paul Erdös: The Giant Component 1960-1993. Random Struct. Algorithms 4(3): 231-232 (1993)
	1992
89		Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor: Bounds for arrays of dots with distinct slopes or lengths. Combinatorica 12(1): 39-44 (1992)
88		Paul Erdös: In memory of Tibor Gallai. Combinatorica 12(4): 373-374 (1992)
87		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau: Extremal problems involving vertices and edges on odd cycles. Discrete Mathematics 101(1-3): 23-31 (1992)
86		Paul Erdös, András Sárközy: Arithmetic progressions in subset sums. Discrete Mathematics 102(3): 249-264 (1992)
85		Richard A. Duke, Paul Erdös, Vojtech Rödl: Cycle-connected graphs. Discrete Mathematics 108(1-3): 261-278 (1992)
84		Paul Erdös, Tibor Gallai, Zsolt Tuza: Covering the cliques of a graph with vertices. Discrete Mathematics 108(1-3): 279-289 (1992)
83		Andreas Blass, Paul Erdös, Alan D. Taylor: Diverse Homogeneous Sets. J. Comb. Theory, Ser. A 59(2): 312-317 (1992)
82		Paul Erdös, D. Frank Hsu: Distributed Loop Network with Minimum Transmission Delay. Theor. Comput. Sci. 100(1): 223-241 (1992)
	1991
81		Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman: Crossing Families. Symposium on Computational Geometry 1991: 351-356
80		David Avis, Paul Erdös, János Pach: Distinct Distances Determined By Subsets of a Point Set in Space. Comput. Geom. 1: 1-11 (1991)
79		Paul Erdös, Joel Spencer: Lopsided Lovász Local Lemma and Latin transversals. Discrete Applied Mathematics 30(2-3): 151-154 (1991)
78		Paul Erdös, Fred Galvin: Some Ramsey-type theorems. Discrete Mathematics 87(3): 261-269 (1991)
77		Paul Erdös, Siemion Fajtlowicz, William Staton: Degree sequences in triangle-free graphs. Discrete Mathematics 92(1-3): 85-88 (1991)
76		Paul Erdös, Jean A. Larson: Matchings from a set below to a set above. Discrete Mathematics 95(1-3): 169-182 (1991)
75		Paul Erdös, Zoltán Füredi, Zsolt Tuza: Saturated r-uniform hypergraphs. Discrete Mathematics 98(2): 95-104 (1991)
74		Paul Erdös, András Hajnal, Zsolt Tuza: Local constraints ensuring small representing sets. J. Comb. Theory, Ser. A 58(1): 78-84 (1991)
73		Paul Erdös, András Gyárfás, László Pyber: Vertex coverings by monochromatic cycles and trees. J. Comb. Theory, Ser. B 51(1): 90-95 (1991)
72		Paul Erdös, Henry A. Kierstead, William T. Trotter: The Dimension of Random Ordered Sets. Random Struct. Algorithms 2(3): 254-276 (1991)
71		Paul Erdös, Peter C. Fishburn, Zoltán Füredi: Midpoints of Diagonals of Convex n-GONS. SIAM J. Discrete Math. 4(3): 329-341 (1991)
	1990
70		Paul Erdös, János Pach: Variation on the theme of repeated distances. Combinatorica 10(3): 261-269 (1990)
69		Paul Erdös, Péter Komjáth: Countable Decompositions of R2 and R3. Discrete & Computational Geometry 5: 325-331 (1990)
68		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Subgraphs of minimal degree k. Discrete Mathematics 85(1): 53-58 (1990)
67		Tom C. Brown, Paul Erdös, Allen R. Freedman: Quasi-progressions and descending waves. J. Comb. Theory, Ser. A 53(1): 81-95 (1990)
66		Paul Erdös, Prasad Tetali: Representations of Integers as the Sum of k Terms. Random Struct. Algorithms 1(3): 245-262 (1990)
	1989
65		Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein: The size of chordal, interval and threshold subgraphs. Combinatorica 9(3): 245-253 (1989)
64		Noga Alon, Paul Erdös: Disjoint Edges in Geometric Graphs. Discrete & Computational Geometry 4: 287-290 (1989)
63		Paul Erdös, László Lovász, Katalin Vesztergombi: On the Graph of Large Distance. Discrete & Computational Geometry 4: 541-549 (1989)
62		Paul Erdös, András Hajnal: Ramsey-type theorems. Discrete Applied Mathematics 25(1-2): 37-52 (1989)
61		Paul Erdös, András Hajnal: On the number of distinct induced subgraphs of a graph. Discrete Mathematics 75(1-3): 145-154 (1989)
60		Paul Erdös, Jean-Louis Nicolas, András Sárközy: On the number of partitions of n without a given subsum (I). Discrete Mathematics 75(1-3): 155-166 (1989)
59		Paul Erdös, Joel H. Spencer: Monochromatic sumsets. J. Comb. Theory, Ser. A 50(1): 162-163 (1989)
58		Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza: Radius, diameter, and minimum degree. J. Comb. Theory, Ser. B 47(1): 73-79 (1989)
	1988
57		Paul Erdös, Hans Riesel: On Admissible Constellations of Consecutive Primes. BIT 28(3): 391-396 (1988)
56		Ron Aharoni, Paul Erdös, Nathan Linial: Optima of dual integer linear programs. Combinatorica 8(1): 13-20 (1988)
55		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Extremal theory and bipartite graph-tree Ramsey numbers. Discrete Mathematics 72(1-3): 103-112 (1988)
54		Paul Erdös: Problems and results in combinatorial analysis and graph theory. Discrete Mathematics 72(1-3): 81-92 (1988)
53		Paul Erdös, Ralph J. Faudree, Edward T. Ordman: Clique partitions and clique coverings. Discrete Mathematics 72(1-3): 93-101 (1988)
52		Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer: How to make a graph bipartite. J. Comb. Theory, Ser. B 45(1): 86-98 (1988)
51		Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks: Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. Mathematical Systems Theory 21(2): 85-98 (1988)
	1987
50		Paul Erdös, Nathan Linial, Shlomo Moran: Extremal problems on permutations under cyclic equivalence. Discrete Mathematics 64(1): 1-11 (1987)
49		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: A Ramsey problem of Harary on graphs with prescribed size. Discrete Mathematics 67(3): 227-233 (1987)
	1986
48		D. de Caen, Paul Erdös, N. J. Pullmann, Nicholas C. Wormald: Extremal clique coverings of complementary graphs. Combinatorica 6(4): 309-314 (1986)
47		Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress: Coloring graphs with locally few colors. Discrete Mathematics 59(1-2): 21-34 (1986)
46		Paul Erdös, Marcel Erné: Clique numbers of graphs. Discrete Mathematics 59(3): 235-242 (1986)
45		Paul Erdös: On some metric and combinatorial geometric problems. Discrete Mathematics 60: 147-153 (1986)
44		Paul Erdös, Michael E. Saks, Vera T. Sós: Maximum induced trees in graphs. J. Comb. Theory, Ser. B 41(1): 61-79 (1986)
	1985
43		Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein: Bounds on threshold dimension and disjoint threshold coverings (abstract only). ACM Conference on Computer Science 1985: 422
42		Ron Aharoni, Paul Erdös, Nathan Linial: Dual Integer Linear Programs and the Relationship between their Optima STOC 1985: 476-483
41		Mohamed M. El-Zahar, Paul Erdös: On the existence of two non-neighboring subgraphs in a graph. Combinatorica 5(4): 295-300 (1985)
40		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Multipartite graph - space graph Ramsey numbers. Combinatorica 5(4): 311-318 (1985)
39		Paul Erdös, András Hajnal: Chromatic number of finite and infinite graphs and hypergraphs. Discrete Mathematics 53: 281-285 (1985)
38		Paul Erdös, Douglas B. West: A note on the interval number of a graph. Discrete Mathematics 55(2): 129-133 (1985)
37		Paul Erdös, Joel C. Fowler, Vera T. Sós, Richard M. Wilson: On 2-Designs. J. Comb. Theory, Ser. A 38(2): 131-142 (1985)
36		Tom C. Brown, Paul Erdös, Fan R. K. Chung, Ronald L. Graham: Quantitative Forms of a Theorem of Hilbert. J. Comb. Theory, Ser. A 38(2): 210-216 (1985)
35		Fan R. K. Chung, Paul Erdös, Joel H. Spencer: Extremal subgraphs for two graphs. J. Comb. Theory, Ser. B 38(3): 248-260 (1985)
34		Roger B. Eggleton, Paul Erdös, D. K. Skilton: Colouring the real line. J. Comb. Theory, Ser. B 39(1): 86-100 (1985)
	1984
33		Paul Erdös, N. Hindman: Enumeration of intersecting families. Discrete Mathematics 48(1): 61-65 (1984)
32		Paul Erdös, Zbigniew Palka: Addendum to "trees in random graphs". Discrete Mathematics 48(2-3): 331 (1984)
	1983
31		Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi: More results on Ramsey - Turán Type problems. Combinatorica 3(1): 69-81 (1983)
30		Fan R. K. Chung, Paul Erdös: On unavoidable graphs. Combinatorica 3(2): 167-176 (1983)
29		Paul Erdös, Miklós Simonovits: Supersaturated graphs and hypergraphs. Combinatorica 3(2): 181-192 (1983)
28		Paul Erdös, Zbigniew Palka: Trees in random graphs. Discrete Mathematics 46(2): 145-150 (1983)
27		Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson: Finite linear spaces and projective planes. Discrete Mathematics 47: 49-62 (1983)
	1982
26		Paul Erdös: Personal reminiscences and remarks on the mathematical work of Tibor Gallai. Combinatorica 2(3): 207-212 (1982)
25		Paul Erdös, Miklós Simonovits: Compactness results in extremal graph theory. Combinatorica 2(3): 275-288 (1982)
24		Paul Erdös, Vera T. Sós: On Ramsey - Turán type theorems for hypergraphs. Combinatorica 2(3): 289-295 (1982)
23		Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Ramsey-minimal graphs for forests. Discrete Mathematics 38(1): 23-32 (1982)
22		Paul Erdös, George B. Purdy, Ernst G. Straus: On a problem in combinatorial geometry. Discrete Mathematics 40(1): 45-52 (1982)
21		Paul Erdös, Arthur M. Hobbs, C. Payan: Disjoint cliques and disjoint maximal independent sets of vertices in graphs. Discrete Mathematics 42(1): 57-61 (1982)
20		Fan R. K. Chung, Paul Erdös, Ronald L. Graham: Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs. J. Comb. Theory, Ser. A 32(2): 241-251 (1982)
19		Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Graphs with certain families of spanning trees. J. Comb. Theory, Ser. B 32(2): 162-170 (1982)
	1981
18		Fan R. K. Chung, Paul Erdös, Ronald L. Graham: Minimal decompositions of graphs into mutually isomorphic subgraphs. Combinatorica 1(1): 13-24 (1981)
17		Paul Erdös: On the combinatorial problems which I would most like to see solved. Combinatorica 1(1): 25-42 (1981)
16		Paul Erdös, Siemion Fajtlowicz: On the conjecture of Hajós. Combinatorica 1(2): 141-143 (1981)
15		Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi: On Turáns theorem for sparse graphs. Combinatorica 1(4): 313-317 (1981)
14		Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Ramsey-minimal graphs for star-forests. Discrete Mathematics 33(3): 227-237 (1981)
13		Paul Erdös, George Mills: Some Bounds for the Ramsey-Paris-Harrington Numbers. J. Comb. Theory, Ser. A 30(1): 53-70 (1981)
	1980
12		László Babai, Paul Erdös, Stanley M. Selkow: Random Graph Isomorphism. SIAM J. Comput. 9(3): 628-635 (1980)
	1978
11		Paul Erdös, Endre Szemerédi: Combinatorial Properties of Systems of Sets. J. Comb. Theory, Ser. A 24(3): 308-313 (1978)
10		Paul Erdös, George B. Purdy: Some Combinatorial Problems in the Plane. J. Comb. Theory, Ser. A 25(2): 205-210 (1978)
	1977
9		Paul Erdös, Arthur M. Hobbs: Hamiltonian cycles in regular graphs of moderate degree. J. Comb. Theory, Ser. B 23(1): 139-142 (1977)
8		D. T. Busolini, Paul Erdös: On a problem in extremal graph theory. J. Comb. Theory, Ser. B 23(2-3): 251-254 (1977)
7		Paul Erdös, Robin J. Wilson: On the chromatic index of almost all graphs. J. Comb. Theory, Ser. B 23(2-3): 255-257 (1977)
	1976
6		M. Cates, Paul Erdös, N. Hindman, Bruce Rothschild: Partition Theorems for Subsets of Vector Spaces. J. Comb. Theory, Ser. A 20(3): 279-291 (1976)
5		Béla Bollobás, Paul Erdös: On a Ramsey-Turán type problem. J. Comb. Theory, Ser. B 21(2): 166-168 (1976)
	1975
4		Paul Erdös, Ronald L. Graham: On Packing Squares with Equal Squares. J. Comb. Theory, Ser. A 19(1): 119-123 (1975)
	1974
3		Paul Erdös: Remark on a Theorem of Lindström. J. Comb. Theory, Ser. A 17(1): 129-130 (1974)
	1973
2		Paul Erdös, J. L. Selfridge: On a Combinatorial Game. J. Comb. Theory, Ser. A 14(3): 298-301 (1973)
1		Paul Erdös, Ronald L. Graham, P. Montgomery, B. L. Rothschild, Joel Spencer, Ernst G. Straus: Euclidean Ramsey Theorems I. J. Comb. Theory, Ser. A 14(3): 341-363 (1973)

Coauthor Index

1	Ron Aharoni	[42] [56]
2	Miklós Ajtai	[15]
3	Noga Alon	[64]
4	Boris Aronov	[81] [109]
5	David Avis	[80]
6	László Babai	[12]
7	Arie Bialostocki	[114]
8	Andreas Blass	[83]
9	Béla Bollobás	[5] [100] [136] [142] [153]
10	John Adrian Bondy	[145]
11	Tom C. Brown	[36] [67]
12	Stefan A. Burr	[14] [23]
13	D. T. Busolini	[8]
14	Dominique de Caen (D. de Caen)	[48]
15	Neil J. Calkin	[125]
16	M. Cates	[6]
17	Guantao Chen	[91] [119]
18	Fan R. K. Chung (Fan Chung Graham)	[18] [20] [30] [35] [36]
19	Marc Deléglise	[144]
20	Jean-Marc Deshouillers	[143]
21	Walter A. Deuber	[126]
22	Richard A. Duke	[85] [154]
23	Roger B. Eggleton	[34]
24	Mohamed M. El-Zahar	[41]
25	Marcel Erné	[46]
26	Siemion Fajtlowicz	[16] [77] [145]
27	Ralph J. Faudree	[14] [19] [23] [40] [49] [52] [53] [55] [68] [87] [97] [104] [105] [113] [141] [152] [153]
28	Peter C. Fishburn	[71] [106] [115] [116] [121] [129] [133]
29	Joel C. Fowler	[37]
30	Allen R. Freedman	[67]
31	Zoltán Füredi	[47] [71] [75] [94] [112] [140]
32	Tibor Gallai	[84] [124]
33	Fred Galvin	[78] [92]
34	Wayne Goddard	[81] [109]
35	Ronald J. Gould	[112] [152]
36	Ronald L. Graham	[1] [4] [18] [20] [36] [89]
37	David S. Gunderson	[112] [126]
38	András Gyárfás	[65] [73] [108] [123] [128] [134] [135] [139]
39	András Hajnal	[31] [39] [47] [61] [62] [74] [99] [107]
40	Richard Roxby Hall	[138]
41	Gergely Harcos	[137]
42	Stephen T. Hedetniemi	[155]
43	N. Hindman	[6] [33]
44	Arthur M. Hobbs	[9] [21]
45	D. Frank Hsu	[82]
46	Michael S. Jacobson	[152]
47	Hal A. Kierstead (Henry A. Kierstead)	[72]
48	Daniel J. Kleitman	[81] [109] [156]
49	Michael Klugerman	[81] [109]
50	Yoshiharu Kohayakawa	[128]
51	Grigori Kolesnik	[151]
52	Péter Komjáth	[47] [69]
53	János Komlós	[15]
54	Israel Koren	[51]
55	Alexandr V. Kostochka	[126]
56	Jean A. Larson	[76]
57	Renu Laskar (Renu C. Laskar)	[155]
58	Hanno Lefmann	[114]
59	Jenö Lehel (Jeno Lehel)	[152]
60	Vsevolod F. Lev	[150]
61	Mordechai Lewin	[118]
62	Nathan Linial (Nati Linial)	[42] [50] [56]
63	László Lovász	[63]
64	Tomasz Luczak	[101] [108] [123]
65	Endre Makai	[96]
66	Janice L. Malouf	[149]
67	Christian Mauduit	[148]
68	A. Meir	[157]
69	Giuseppe Melfi	[143]
70	A. G. Meyer	[126]
71	George Mills	[13]
72	P. Montgomery	[1]
73	Shlomo Moran	[50] [51]
74	Ronald C. Mullin	[27]
75	Jean-Louis Nicolas	[60] [144]
76	Edward T. Ordman	[43] [53] [65] [95]
77	János Pach	[52] [58] [70] [80] [81] [94] [96] [109] [137]
78	Péter P. Pálfy	[147]
79	Zbigniew Palka	[28] [32]
80	C. Payan	[21]
81	Richard Pollack	[58]
82	Geert C. E. Prins	[155]
83	N. J. Pullmann	[48]
84	George B. Purdy	[10] [22] [117]
85	László Pyber	[73] [130]
86	Gerard Rauzy	[150]
87	Talmage James Reid	[113] [122]
88	L. Bruce Richmond	[98]
89	Hans Riesel	[57]
90	Vojtech Rödl	[47] [85] [110] [154]
91	Bruce Rothschild (B. L. Rothschild)	[1] [6] [140]
92	Cecil C. Rousseau	[14] [19] [23] [40] [49] [55] [68] [87] [91] [93] [97] [104] [105] [141] [153]
93	Miklós Ruszinkó	[135]
94	Imre Z. Ruzsa	[89] [94]
95	Michael E. Saks	[44]
96	Csaba Sándor	[150]
97	Amites Sarkar	[142]
98	András Sárközy	[60] [86] [102] [148] [150]
99	Gábor N. Sárközy	[127]
100	Richard H. Schelp	[14] [19] [23] [40] [49] [55] [68] [91] [97] [104] [113] [122] [141] [153]
101	Leonard J. Schulman	[81] [109]
102	J. L. Selfridge	[2] [149]
103	Stanley M. Selkow	[12]
104	Ákos Seress	[47]
105	Gabriel M. Silberman	[51]
106	Miklós Simonovits	[25] [29] [99] [107]
107	D. K. Skilton	[34]
108	Vera T. Sós	[24] [27] [31] [37] [44] [99] [102] [107] [140] [157]
109	Joel H. Spencer (Joel Spencer)	[1] [35] [52] [59] [79] [100]
110	William Staton	[77] [113] [119] [122]
111	Douglas R. Stinson	[27]
112	Ernst G. Straus	[1] [22]
113	Stephen Suen	[111]
114	Esther Szekeres	[149]
115	Endre Szemerédi	[11] [15] [31] [99] [107]
116	Alan D. Taylor	[83]
117	Herbert Taylor	[89]
118	Gerald Tenenbaum	[146]
119	Prasad Tetali	[66]
120	Craig A. Tovey	[125]
121	William T. Trotter	[72]
122	P. Turán	[157]
123	Zsolt Tuza	[58] [74] [75] [84] [120] [124]
124	Pavel Valtr	[120]
125	Katalin Vesztergombi	[63]
126	Douglas B. West	[38] [100]
127	Richard M. Wilson	[37]
128	Robin J. Wilson	[7]
129	Peter Winkler (Peter M. Winkler)	[111]
130	Nicholas C. Wormald	[48]
131	Shmuel Zaks	[51]
132	Yechezkel Zalcstein	[43] [65] [95]

Colors in the list of coauthors