default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Erdös
Person information
- affiliation: Hungarian Academy of Sciences, Mathematical Institute, Budapest, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2015
[j213]Steve Butler, Paul Erdös, Ron Graham:
Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors. Integers 15: A51 (2015)- 2013
- [p2]Paul Erdös:
Some of My Favorite Problems and Results. The Mathematics of Paul Erdős I 2013: 51-70 - [p1]Vitaly Bergelson, Paul Erdös, Neil Hindman, Tomasz Luczak
:
Dense Difference Sets and Their Combinatorial Structure. The Mathematics of Paul Erdős I 2013: 133-146
2000 – 2009
- 2006
- [j212]Paul Erdös, Amram Meir, Vera T. Sós, Paul Turán:
On some applications of graph theory, I. Discret. Math. 306(10-11): 853-866 (2006) - [j211]Paul Erdös, Daniel J. Kleitman:
Extremal problems among subsets of a set. Discret. Math. 306(10-11): 923-931 (2006) - 2003
- [j210]Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, Geert C. E. Prins:
On the equality of the partial Grundy and upper ochromatic numbers of graphs. Discret. Math. 272(1): 53-64 (2003) - [j209]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
- [j208]Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Random induced graphs. Discret. Math. 248(1-3): 249-254 (2002) - [j207]Noga Alon, Paul Erdös, David S. Gunderson, Michael Molloy:
A Ramsey-type problem and the Turán numbers. J. Graph Theory 40(2): 120-129 (2002) - 2001
- [j206]Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel:
Edge disjoint monochromatic triangles in 2-colored graphs. Discret. Math. 231(1-3): 135-141 (2001)
1990 – 1999
- 1999
- [j205]Béla Bollobás, Paul Erdös, Amites Sarkar:
Extremal graphs for weights. Discret. Math. 200(1-3): 5-19 (1999) - [j204]J. Adrian Bondy, Paul Erdös, Siemion Fajtlowicz:
Graphs of diameter two with no 4-circuits. Discret. Math. 200(1-3): 21-25 (1999) - [j203]Marc Deléglise, Paul Erdös, Jean-Louis Nicolas:
Sur les ensembles représentés par les partitions d'un entier n1. Discret. Math. 200(1-3): 27-48 (1999) - [j202]Jean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi:
On a question about sum-free sequences. Discret. Math. 200(1-3): 49-54 (1999) - [j201]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. Discret. Math. 200(1-3): 55-60 (1999) - [j200]Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós:
Induced subgraphs of given sizes. Discret. Math. 200(1-3): 61-77 (1999) - [j199]Paul Erdös, András Gyárfás:
Split and balanced colorings of complete graphs. Discret. Math. 200(1-3): 79-86 (1999) - [j198]Paul Erdös, Richard Roxby Hall:
On the angular distribution of Gaussian integers with fixed norm. Discret. Math. 200(1-3): 87-94 (1999) - [j197]Paul Erdös, Gergely Harcos, János Pach:
Popular distances in 3-space. Discret. Math. 200(1-3): 95-99 (1999) - [j196]Paul Erdös, Grigori Kolesnik:
Prime power divisors of binomial coefficients. Discret. Math. 200(1-3): 101-117 (1999) - [j195]Paul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy:
Greedy algorithm, arithmetic progressions, subset sums and divisibility. Discret. Math. 200(1-3): 119-135 (1999) - [j194]Paul Erdös, Janice L. Malouf, John L. Selfridge, Esther Szekeres:
Subsets of an interval whose product is a power. Discret. Math. 200(1-3): 137-147 (1999) - [j193]Paul Erdös, Christian Mauduit, András Sárközy:
On arithmetic properties of integers with missing digits II: Prime factors. Discret. Math. 200(1-3): 149-164 (1999) - [j192]Paul Erdös, Péter P. Pálfy:
On the orders of directly indecomposable groups. Discret. Math. 200(1-3): 165-179 (1999) - [j191]Paul Erdös, Gerald Tenenbaum:
Ensembles de multiples de suites finies. Discret. Math. 200(1-3): 181-203 (1999) - [j190]Paul Erdös, Tom Fowler:
Finding Large p-Colored Diameter Two Subgraphs. Graphs Comb. 15(1): 21-27 (1999) - 1998
- [j189]Béla Bollobás, Paul Erdös:
Graphs of Extremal Weights. Ars Comb. 50 (1998) - [j188]Paul Erdös, András Gyárfás, Miklós Ruszinkó:
How to decrease the diameter of triangle-free graphs. Comb. 18(4): 493-501 (1998) - 1997
- [j187]Paul Erdös, András Gyárfás:
A Variant of the Classical Ramsey Problem. Comb. 17(4): 459-467 (1997) - [j186]Paul Erdös, Gábor N. Sárközy:
On cycles in the coprime graph of integers. Electron. J. Comb. 4(2) (1997) - [j185]Paul Erdös, Peter C. Fishburn:
Minimum Planar Sets with Maximum Equidistance Counts. Comput. Geom. 7: 207-218 (1997) - [j184]Paul Erdös:
Some recent problems and results in graph theory. Discret. Math. 164(1-3): 81-85 (1997) - [j183]Paul Erdös:
Some old and new problems in various branches of combinatorics. Discret. Math. 165-166: 227-231 (1997) - [j182]Paul Erdös, László Pyber:
Covering a graph by complete bipartite graphs. Discret. Math. 170(1-3): 249-251 (1997) - [j181]Paul Erdös, Peter C. Fishburn:
Distinct distances in finite planar sets. Discret. Math. 175(1-3): 97-132 (1997) - [j180]Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa:
The size of the largest bipartite subgraphs. Discret. Math. 177(1-3): 267-271 (1997) - [j179]Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp:
A Class of Edge Critical 4-Chromatic Graphs. Graphs Comb. 13(2): 139-146 (1997) - [j178]Walter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer:
Intersection Statements for Systems of Sets. J. Comb. Theory A 79(1): 118-132 (1997) - [j177]Neil J. Calkin, Paul Erdös, Craig A. Tovey:
New Ramsey Bounds from Cyclic Graphs of Prime Order. SIAM J. Discret. Math. 10(3): 381-387 (1997) - 1996
- [j176]Paul Erdös, Tibor Gallai, Zsolt Tuza:
Covering and independence in triangle structures. Discret. Math. 150(1-3): 89-101 (1996) - [j175]Paul Erdös, András Gyárfás, Tomasz Luczak:
Graphs in which each C4 spans K4. Discret. Math. 154(1-3): 263-268 (1996) - [j174]Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton:
Sizes of graphs with induced subgraphs of large maximum degree. Discret. Math. 158(1-3): 283-286 (1996) - [j173]Paul Erdös, Peter C. Fishburn:
Maximum planar sets that determine k distances. Discret. Math. 160(1-3): 115-125 (1996) - [j172]Paul Erdös, Zsolt Tuza, Pavel Valtr:
Ramsey-remainder. Eur. J. Comb. 17(6): 519-532 (1996) - [j171]Guantao Chen, Paul Erdös, William Staton:
Proof of a Conjecture of Bollob's on Nested Cycles. J. Comb. Theory B 66(1): 38-43 (1996) - [j170]Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich:
On k-saturated graphs with restrictions on the degrees. J. Graph Theory 23(1): 1-20 (1996) - [j169]Paul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley:
Hypercube subgraphs with minimal detours. J. Graph Theory 23(2): 119-128 (1996) - [j168]Paul Erdös, Mordechai Lewin:
d-complete sequences of integers. Math. Comput. 65(214): 837-840 (1996) - 1995
- [j167]Paul Erdös, Peter C. Fishburn:
Multiplicities of Interpoint Distances in Finite Planar Sets. Discret. Appl. Math. 60(1-3): 141-147 (1995) - [j166]Paul Erdös, Peter C. Fishburn:
Intervertex Distances in Convex Polygons. Discret. Appl. Math. 60(1-3): 149-158 (1995) - [j165]Paul Erdös, George B. Purdy:
Two Combinatorial Problems in the Plane. Discret. Comput. Geom. 13: 441-443 (1995) - [j164]Arie Bialostocki, Paul Erdös, Hanno Lefmann:
Monochromatic and zero-sum sets of nondecreasing diameter. Discret. Math. 137(1-3): 19-34 (1995) - [j163]Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton:
Degree sequence and independence in K(4)-free graphs. Discret. Math. 141(1-3): 285-290 (1995) - [j162]Paul Erdös, András Sárközy, Vera T. Sós:
On product representations of powers, I. Eur. J. Comb. 16(6): 567-588 (1995) - [j161]Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson:
Extremal Graphs for Intersecting Triangles. J. Comb. Theory B 64(1): 89-100 (1995) - [j160]Paul Erdös, Stephen Suen, Peter Winkler:
On the Size of a Random Maximal Graph. Random Struct. Algorithms 6(2/3): 309-318 (1995) - [j159]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
- [j158]Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. Comb. 14(2): 127-134 (1994) - [j157]Paul Erdös, András Gyárfás, Tomasz Luczak:
Independet Transversals in Sparse Partite Hypergraphs. Comb. Probab. Comput. 3: 293-296 (1994) - [j156]Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey Theorems and Kp-Independence Numbers. Comb. Probab. Comput. 3: 297-325 (1994) - [j155]Paul Erdös, Peter C. Fishburn:
A Postscript on Distances in Convex n-Gons. Discret. Comput. Geom. 11: 111-117 (1994) - [j154]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau:
Extremal problems and generalized degrees. Discret. Math. 127(1-3): 139-152 (1994) - [j153]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
A local density condition for triangles. Discret. Math. 127(1-3): 153-161 (1994) - [j152]Paul Erdös:
Problems and results in discrete mathematics. Discret. Math. 136(1-3): 53-73 (1994) - [j151]Paul Erdös, András Sárközy, Vera T. Sós:
On additive properties of general sequences. Discret. Math. 136(1-3): 75-99 (1994) - [j150]Edward A. Bertram, Paul Erdös, Peter Horák, Jozef Sirán, Zsolt Tuza:
Local and global average degree in graphs and multigraphs. J. Graph Theory 18(7): 647-661 (1994) - [j149]Paul Erdös, Tomasz Luczak:
Change of Leadership in a Random Graph Process. Random Struct. Algorithms 5(1): 243-252 (1994) - 1993
- [j148]Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West:
Clique coverings of the edges of a random graph. Comb. 13(1): 1-5 (1993) - [j147]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. Comb. 13(1): 31-56 (1993) - [j146]Paul Erdös, L. Bruce Richmond:
On graphical partitions. Comb. 13(1): 57-63 (1993) - [j145]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Ramsey Size Linear Graphs. Comb. Probab. Comput. 2: 389-399 (1993) - [j144]Paul Erdös, Endre Makai, János Pach:
Nearly Equal Distances in the Plane. Comb. Probab. Comput. 2: 401-408 (1993) - [j143]Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein:
Clique Partitions of Chordal Graphs. Comb. Probab. Comput. 2: 409-415 (1993) - [j142]Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa:
The grid revisted. Discret. Math. 111(1-3): 189-196 (1993) - [j141]Paul Erdös, Fred Galvin:
Monochromatic infinite paths. Discret. Math. 113(1-3): 59-70 (1993) - [j140]Paul Erdös, Cecil C. Rousseau:
The size Ramsey number of a complete bipartite graph. Discret. Math. 113(1-3): 259-262 (1993) - [j139]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) - 1992
- [j138]Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor:
Bounds for arrays of dots with distinct slopes or lengths. Comb. 12(1): 39-44 (1992) - [j137]Paul Erdös:
In memory of Tibor Gallai. Comb. 12(4): 373-374 (1992) - [j136]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau:
Extremal problems involving vertices and edges on odd cycles. Discret. Math. 101(1-3): 23-31 (1992) - [j135]Paul Erdös, András Sárközy:
Arithmetic progressions in subset sums. Discret. Math. 102(3): 249-264 (1992) - [j134]Richard A. Duke, Paul Erdös, Vojtech Rödl:
Cycle-connected graphs. Discret. Math. 108(1-3): 261-278 (1992) - [j133]Paul Erdös, Tibor Gallai, Zsolt Tuza:
Covering the cliques of a graph with vertices. Discret. Math. 108(1-3): 279-289 (1992) - [j132]Andreas Blass, Paul Erdös, Alan D. Taylor:
Diverse Homogeneous Sets. J. Comb. Theory A 59(2): 312-317 (1992) - [j131]Paul Erdös:
An Extremal Problem. SIAM Rev. 34(2): 308 (1992) - [j130]Paul Erdös:
Optimum Multiple Access Coding (D.B. Jevtić). SIAM Rev. 34(2): 309-310 (1992) - [j129]Paul Erdös, D. Frank Hsu:
Distributed Loop Network with Minimum Transmission Delay. Theor. Comput. Sci. 100(1): 223-241 (1992) - 1991
- [j128]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) - [j127]Paul Erdös, Joel Spencer:
Lopsided Lovász Local Lemma and Latin transversals. Discret. Appl. Math. 30(2-3): 151-154 (1991) - [j126]Paul Erdös, Fred Galvin:
Some Ramsey-type theorems. Discret. Math. 87(3): 261-269 (1991) - [j125]Paul Erdös, Siemion Fajtlowicz, William Staton:
Degree sequences in triangle-free graphs. Discret. Math. 92(1-3): 85-88 (1991) - [j124]Paul Erdös, Jean A. Larson:
Matchings from a set below to a set above. Discret. Math. 95(1-3): 169-182 (1991) - [j123]Paul Erdös, Zoltán Füredi, Zsolt Tuza:
Saturated r-uniform hypergraphs. Discret. Math. 98(2): 95-104 (1991) - [j122]Paul Erdös, András Gyárfás, László Pyber:
Vertex coverings by monochromatic cycles and trees. J. Comb. Theory B 51(1): 90-95 (1991) - [j121]Paul Erdös, András Hajnal, Zsolt Tuza:
Local constraints ensuring small representing sets. J. Comb. Theory A 58(1): 78-84 (1991) - [j120]Paul Erdös, John G. Gimbel, Dieter Kratsch:
Some extremal results in cochromatic and dichromatic theory. J. Graph Theory 15(6): 579-585 (1991) - [j119]Paul Erdös, Henry A. Kierstead, William T. Trotter:
The Dimension of Random Ordered Sets. Random Struct. Algorithms 2(3): 254-276 (1991) - [j118]Paul Erdös, Peter C. Fishburn, Zoltán Füredi:
Midpoints of Diagonals of Convex n-GONS. SIAM J. Discret. Math. 4(3): 329-341 (1991) - [c4]Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. SCG 1991: 351-356 - 1990
- [j117]Paul Erdös, János Pach:
Variation on the theme of repeated distances. Comb. 10(3): 261-269 (1990) - [j116]Paul Erdös, Péter Komjáth:
Countable Decompositions of R2 and R3. Discret. Comput. Geom. 5: 325-331 (1990) - [j115]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Subgraphs of minimal degree k. Discret. Math. 85(1): 53-58 (1990) - [j114]Paul Erdös, John Gimbel, H. Joseph Straight:
Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number. Eur. J. Comb. 11(3): 235-240 (1990) - [j113]Roger B. Eggleton, Paul Erdös, D. K. Skilton:
Colouring prime distance graphs. Graphs Comb. 6(1): 17-32 (1990) - [j112]Tom C. Brown, Paul Erdös, Allen R. Freedman:
Quasi-progressions and descending waves. J. Comb. Theory A 53(1): 81-95 (1990) - [j111]Paul Erdös, Prasad Tetali:
Representations of Integers as the Sum of k Terms. Random Struct. Algorithms 1(3): 245-262 (1990) - [c3]Paul Erdös, Endre Makai, János Pach, Joel H. Spencer:
Gaps in Difference Sets, and the Graph of Nearly Equal Distances. Applied Geometry And Discrete Mathematics 1990: 265-274
1980 – 1989
- 1989
- [j110]Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein:
The size of chordal, interval and threshold subgraphs. Comb. 9(3): 245-253 (1989) - [j109]Paul Erdös, András Hajnal:
Ramsey-type theorems. Discret. Appl. Math. 25(1-2): 37-52 (1989) - [j108]Noga Alon, Paul Erdös:
Disjoint Edges in Geometric Graphs. Discret. Comput. Geom. 4: 287-290 (1989) - [j107]Paul Erdös, László Lovász, Katalin Vesztergombi:
On the Graph of Large Distance. Discret. Comput. Geom. 4: 541-549 (1989) - [j106]Paul Erdös, András Hajnal:
On the number of distinct induced subgraphs of a graph. Discret. Math. 75(1-3): 145-154 (1989) - [j105]Paul Erdös, Jean-Louis Nicolas, András Sárközy:
On the number of partitions of n without a given subsum (I). Discret. Math. 75(1-3): 155-166 (1989) - [j104]Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza:
Radius, diameter, and minimum degree. J. Comb. Theory B 47(1): 73-79 (1989) - [j103]Paul Erdös, Joel H. Spencer:
Monochromatic sumsets. J. Comb. Theory A 50(1): 162-163 (1989) - [j102]Stefan A. Burr, Paul Erdös, Ronald L. Graham, Vera T. Sós:
Maximal antiramsey graphs and the strong chromatic number. J. Graph Theory 13(3): 263-282 (1989) - [j101]Carsten Thomassen, Paul Erdös, Yousef Alavi, Paresh J. Malde, Allen J. Schwenk:
Tight bounds on the chromatic sum of a connected graph. J. Graph Theory 13(3): 353-357 (1989) - [j100]Paul Erdös, Anthony B. Evans:
Representations of graphs and orthogonal latin square graphs. J. Graph Theory 13(5): 593-595 (1989) - [j99]Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp:
Domination in colored complete graphs. J. Graph Theory 13(6): 713-718 (1989) - 1988
- [j98]Paul Erdös, Hans Riesel:
On Admissible Constellations of Consecutive Primes. BIT 28(3): 391-396 (1988) - [j97]Ron Aharoni, Paul Erdös, Nathan Linial:
Optima of dual integer linear programs. Comb. 8(1): 13-20 (1988) - [j96]Paul Erdös:
Problems and results in combinatorial analysis and graph theory. Discret. Math. 72(1-3): 81-92 (1988) - [j95]Paul Erdös, Ralph J. Faudree, Edward T. Ordman:
Clique partitions and clique coverings. Discret. Math. 72(1-3): 93-101 (1988) - [j94]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Extremal theory and bipartite graph-tree Ramsey numbers. Discret. Math. 72(1-3): 103-112 (1988) - [j93]Paul Erdös, Chris D. Godsil, Steven G. Krantz, Torrence D. Parsons:
Intersection Graphs for Families of Balls in Rn. Eur. J. Comb. 9(5): 501-505 (1988) - [j92]David Avis, Paul Erdös, János Pach:
Repeated distances in space. Graphs Comb. 4(1): 207-217 (1988) - [j91]Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer:
How to make a graph bipartite. J. Comb. Theory B 45(1): 86-98 (1988) - [j90]Lou Caccetta, Paul Erdös, K. Vijayan:
Graphs with unavoidable subgraphs with large degrees. J. Graph Theory 12(1): 17-27 (1988) - [j89]Paul Erdös, Mark Goldberg, János Pach, Joel Spencer:
Cutting a graph into two dissimilar halves. J. Graph Theory 12(1): 121-131 (1988) - [j88]Paul Erdös:
A tribute to Torrence Parsons. J. Graph Theory 12(2): v-vi (1988) - [j87]Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks:
Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. Math. Syst. Theory 21(2): 85-98 (1988) - 1987
- [j86]Paul Erdös, Nathan Linial, Shlomo Moran:
Extremal problems on permutations under cyclic equivalence. Discret. Math. 64(1): 1-11 (1987) - [j85]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
A Ramsey problem of Harary on graphs with prescribed size. Discret. Math. 67(3): 227-233 (1987) - [j84]Paul Erdös, J. W. Kennedy:
k-Connectivity in Random Graphs. Eur. J. Comb. 8(3): 281-286 (1987) - [j83]Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson:
Goodness of trees for generalized books. Graphs Comb. 3(1): 1-6 (1987) - [j82]Paul Erdös, W. R. Hare, Stephen T. Hedetniemi, Renu C. Laskar:
On the equality of the grundy and ochromatic numbers of a graph. J. Graph Theory 11(2): 157-159 (1987) - [j81]Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann:
Highly irregular graphs. J. Graph Theory 11(2): 235-249 (1987) - [j80]Fan R. K. Chung, Paul Erdös:
On unavoidable hypergraphs. J. Graph Theory 11(2): 251-263 (1987) - 1986
- [j79]D. de Caen, Paul Erdös, Norman J. Pullmann, Nicholas C. Wormald:
Extremal clique coverings of complementary graphs. Comb. 6(4): 309-314 (1986) - [j78]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. Discret. Math. 59(1-2): 21-34 (1986) - [j77]Paul Erdös, Marcel Erné:
Clique numbers of graphs. Discret. Math. 59(3): 235-242 (1986) - [j76]Paul Erdös:
On some metric and combinatorial geometric problems. Discret. Math. 60: 147-153 (1986) - [j75]Paul Erdös, Peter Frankl, Vojtech Rödl:
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Comb. 2(1): 113-121 (1986) - [j74]Paul Erdös:
Two problems in extremal graph theory. Graphs Comb. 2(1): 189-190 (1986) - [j73]Paul Erdös, Michael E. Saks, Vera T. Sós:
Maximum induced trees in graphs. J. Comb. Theory B 41(1): 61-79 (1986) - 1985
- [j72]Mohamed M. El-Zahar, Paul Erdös:
On the existence of two non-neighboring subgraphs in a graph. Comb. 5(4): 295-300 (1985) - [j71]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Multipartite graph - space graph Ramsey numbers. Comb. 5(4): 311-318 (1985) - [j70]Paul Erdös, András Hajnal:
Chromatic number of finite and infinite graphs and hypergraphs. Discret. Math. 53: 281-285 (1985) - [j69]Paul Erdös, Douglas B. West:
A note on the interval number of a graph. Discret. Math. 55(2): 129-133 (1985) - [j68]Noga Alon, Paul Erdös:
An Application of Graph Theory to Additive Number Theory. Eur. J. Comb. 6(3): 201-203 (1985) - [j67]Claude Berge, Paul Erdös, Sin Hitotumatu, Loo Keng Hua, Richard Rado:
Notes of welcome. Graphs Comb. 1(1): 3-6 (1985) - [j66]Paul Erdös, Joel C. Fowler, Vera T. Sós, Richard M. Wilson:
On 2-Designs. J. Comb. Theory A 38(2): 131-142 (1985) - [j65]Tom C. Brown, Paul Erdös, Fan R. K. Chung, Ronald L. Graham:
Quantitative Forms of a Theorem of Hilbert. J. Comb. Theory A 38(2): 210-216 (1985) - [j64]Fan R. K. Chung, Paul Erdös, Joel H. Spencer:
Extremal subgraphs for two graphs. J. Comb. Theory B 38(3): 248-260 (1985) - [j63]Roger B. Eggleton, Paul Erdös, D. K. Skilton:
Colouring the real line. J. Comb. Theory B 39(1): 86-100 (1985) - [j62]Paul Erdös:
Ulam, the man and the mathematician. J. Graph Theory 9(4): 445-449 (1985) - [c2]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 - [c1]Ron Aharoni, Paul Erdös, Nathan Linial:
Dual Integer Linear Programs and the Relationship between their Optima. STOC 1985: 476-483 - 1984
- [j61]Paul Erdös, Neil Hindman:
Enumeration of intersecting families. Discret. Math. 48(1): 61-65 (1984) - [j60]Paul Erdös, Zbigniew Palka:
Addendum to "trees in random graphs". Discret. Math. 48(2-3): 331 (1984) - 1983
- [j59]Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi:
More results on Ramsey - Turán Type problems. Comb. 3(1): 69-81 (1983) - [j58]Fan R. K. Chung, Paul Erdös:
On unavoidable graphs. Comb. 3(2): 167-176 (1983) - [j57]Paul Erdös, Miklós Simonovits:
Supersaturated graphs and hypergraphs. Comb. 3(2): 181-192 (1983) - [j56]Paul Erdös, Zbigniew Palka:
Trees in random graphs. Discret. Math. 46(2): 145-150 (1983) - [j55]Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson:
Finite linear spaces and projective planes. Discret. Math. 47: 49-62 (1983) - [j54]Stefan A. Burr, Paul Erdös:
Generalizations of a Ramsey-theoretic result of chvátal. J. Graph Theory 7(1): 39-51 (1983) - [j53]Paul Erdös, János Pach:
On a Quasi-Ramsey problem. J. Graph Theory 7(1): 137-147 (1983) - [j52]Paul Erdös, Edgar M. Palmer, Robert W. Robinson:
Local connectivity of a random graph. J. Graph Theory 7(4): 411-417 (1983) - 1982
- [j51]Paul Erdös:
Personal reminiscences and remarks on the mathematical work of Tibor Gallai. Comb. 2(3): 207-212 (1982) - [j50]Paul Erdös, Miklós Simonovits:
Compactness results in extremal graph theory. Comb. 2(3): 275-288 (1982) - [j49]Paul Erdös, Vera T. Sós:
On Ramsey - Turán type theorems for hypergraphs. Comb. 2(3): 289-295 (1982) - [j48]Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Ramsey-minimal graphs for forests. Discret. Math. 38(1): 23-32 (1982) - [j47]Paul Erdös, George B. Purdy, Ernst G. Straus:
On a problem in combinatorial geometry. Discret. Math. 40(1): 45-52 (1982) - [j46]Paul Erdös, Arthur M. Hobbs, C. Payan:
Disjoint cliques and disjoint maximal independent sets of vertices in graphs. Discret. Math. 42(1): 57-61 (1982) - [j45]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Graphs with certain families of spanning trees. J. Comb. Theory B 32(2): 162-170 (1982) - [j44]Fan R. K. Chung, Paul Erdös, Ronald L. Graham:
Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs. J. Comb. Theory A 32(2): 241-251 (1982) - [j43]Paul Erdös, Peter Frankl, Zoltán Füredi:
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others. J. Comb. Theory A 33(2): 158-166 (1982) - 1981
- [j42]Fan R. K. Chung, Paul Erdös, Ronald L. Graham:
Minimal decompositions of graphs into mutually isomorphic subgraphs. Comb. 1(1): 13-24 (1981) - [j41]Paul Erdös:
On the combinatorial problems which I would most like to see solved. Comb. 1(1): 25-42 (1981) - [j40]Paul Erdös, Siemion Fajtlowicz:
On the conjecture of Hajós. Comb. 1(2): 141-143 (1981) - [j39]Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi:
On Turáns theorem for sparse graphs. Comb. 1(4): 313-317 (1981) - [j38]Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Ramsey-minimal graphs for star-forests. Discret. Math. 33(3): 227-237 (1981) - [j37]Paul Erdös, George Mills:
Some Bounds for the Ramsey-Paris-Harrington Numbers. J. Comb. Theory A 30(1): 53-70 (1981) - 1980
- [j36]Paul Erdös, János Pach:
On a problem of L. Fejes Tóth. Discret. Math. 30(2): 103-109 (1980) - [j35]Paul Erdös:
Some Applications of Ramsey's Theorem to Additive Number Theory. Eur. J. Comb. 1(1): 43-46 (1980) - [j34]Béla Bollobás, Paul A. Catlin, Paul Erdös:
Hadwiger's Conjecture is True for Almost Every Graph. Eur. J. Comb. 1(3): 195-199 (1980) - [j33]Paul Erdös, Siemion Fajtlowicz, Alan J. Hoffman:
Maximum degree in graphs of diameter 2. Networks 10(1): 87-90 (1980) - [j32]László Babai, Paul Erdös, Stanley M. Selkow:
Random Graph Isomorphism. SIAM J. Comput. 9(3): 628-635 (1980)
1970 – 1979
- 1978
- [j31]Krishnaswami Alladi, Paul Erdös, V. E. Hoggatt Jr.:
On additive partitions of integers. Discret. Math. 22(3): 201-211 (1978) - [j30]Paul Erdös, Stephen H. Hechler, Paul C. Kainen:
On finite superuniversal graphs. Discret. Math. 24(3): 235-249 (1978) - [j29]Paul Erdös, Endre Szemerédi:
Combinatorial Properties of Systems of Sets. J. Comb. Theory A 24(3): 308-313 (1978) - [j28]Paul Erdös, George B. Purdy:
Some Combinatorial Problems in the Plane. J. Comb. Theory A 25(2): 205-210 (1978) - [j27]Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
On cycle - Complete graph ramsey numbers. J. Graph Theory 2(1): 53-64 (1978) - [j26]Paul Erdös, Arthur M. Hobbs:
A class of Hamiltonian regular graphs. J. Graph Theory 2(2): 129-135 (1978) - [j25]William T. Trotter, Paul Erdös:
When the cartesian product of directed cycles is Hamiltonian. J. Graph Theory 2(2): 137-142 (1978) - 1977
- [j24]Paul Erdös, Amram Meir:
On total matching numbers and total covering numbers of complementary graphs. Discret. Math. 19(3): 229-233 (1977) - [j23]Paul Erdös, Arthur M. Hobbs:
Hamiltonian cycles in regular graphs of moderate degree. J. Comb. Theory B 23(1): 139-142 (1977) - [j22]D. T. Busolini, Paul Erdös:
On a problem in extremal graph theory. J. Comb. Theory B 23(2-3): 251-254 (1977) - [j21]Paul Erdös, Robin J. Wilson:
On the chromatic index of almost all graphs. J. Comb. Theory B 23(2-3): 255-257 (1977) - [j20]Paul Erdös:
A note of welcome. J. Graph Theory 1(1): 3 (1977) - [j19]Paul Erdös:
Paul Turán, 1910-1976: His work in graph theory. J. Graph Theory 1(2): 97-101 (1977) - 1976
- [j18]Marshall L. Cates, Paul Erdös, Neil Hindman, Bruce Rothschild:
Partition Theorems for Subsets of Vector Spaces. J. Comb. Theory A 20(3): 279-291 (1976) - [j17]Béla Bollobás, Paul Erdös:
On a Ramsey-Turán type problem. J. Comb. Theory B 21(2): 166-168 (1976) - 1975
- [j16]Michel Deza, Paul Erdös:
Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n. Discret. Math. 12(4): 295-308 (1975) - [j15]Béla Bollobás, Paul Erdös, Endre Szemerédi:
On complete subgraphs of r-chromatic graphs. Discret. Math. 13(2): 97-107 (1975) - [j14]Paul Erdös, Ronald L. Graham:
On Packing Squares with Equal Squares. J. Comb. Theory A 19(1): 119-123 (1975) - 1974
- [j13]B. Andrásfai, Paul Erdös, Vera T. Sós:
On the connection between chromatic number, maximal clique and minimal degree of a graph. Discret. Math. 8(3): 205-218 (1974) - [j12]Paul Erdös, Daniel J. Kleitman:
Extremal problems among subsets of a set. Discret. Math. 8(3): 281-294 (1974) - [j11]Paul Erdös:
Remark on a Theorem of Lindström. J. Comb. Theory A 17(1): 129-130 (1974) - 1973
- [j10]Paul Erdös, Patrik E. O'Neil:
On a generalization of Ramsey numbers. Discret. Math. 4(1): 29-35 (1973) - [j9]Paul Erdös, Miklós Simonovits:
On a valence problem in extremal graph theory. Discret. Math. 5(4): 323-334 (1973) - [j8]Paul Erdös, John L. Selfridge:
On a Combinatorial Game. J. Comb. Theory A 14(3): 298-301 (1973) - [j7]Paul Erdös, Ronald L. Graham, Peter Montgomery, Bruce Lee Rothschild, Joel Spencer, Ernst G. Straus:
Euclidean Ramsey Theorems I. J. Comb. Theory A 14(3): 341-363 (1973) - 1972
- [j6]Vasek Chvátal, Paul Erdös:
A note on Hamiltonian circuits. Discret. Math. 2(2): 111-113 (1972) - [j5]Paul Erdös, Amram Meir, Vera T. Sós, Paul Turán:
On some applications of graph theory, I. Discret. Math. 2(3): 207-228 (1972) - [j4]Vasek Chvátal, Paul Erdös, Z. Hedrlín:
Ramsey's theorem and self-complementary graphs. Discret. Math. 3(4): 301-304 (1972) - 1971
- [j3]Paul Erdös:
On some extremal problems on r-graphs. Discret. Math. 1(1): 1-6 (1971) - [j2]Paul Erdös, Joel H. Spencer:
Imbalances in k-colorations. Networks 1(4): 379-385 (1971)
1950 – 1959
- 1959
- [j1]Paul Erdös:
Elementary Divisors of Normal Matrices. IBM J. Res. Dev. 3(2): 197 (1959)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
