Paul Erdös

Publication Activity (10 Years)

Years Active: 1959-2015
Publications (10 Years): 0

Top Venues

Integers

Publications

Steve Butler, Paul Erdös, Ron Graham
Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors. Integers 15 (2015)
Paul Erdös, Amram Meir, Vera T. Sós, Paul Turán
On some applications of graph theory, I. Discret. Math. 306 (10-11) (2006)
Paul Erdös, Daniel J. Kleitman
Extremal problems among subsets of a set. Discret. Math. 306 (10-11) (2006)
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) (2003)
Richard A. Duke, Paul Erdös, Vojtech Rödl
On large intersecting subfamilies of uniform setfamilies. Random Struct. Algorithms 23 (4) (2003)
Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Random induced graphs. Discret. Math. 248 (1-3) (2002)
Noga Alon, Paul Erdös, David S. Gunderson, Michael Molloy
A Ramsey-type problem and the Turán numbers. J. Graph Theory 40 (2) (2002)
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) (2001)
Paul Erdös, Gerald Tenenbaum
Ensembles de multiples de suites finies. Discret. Math. 200 (1-3) (1999)
Jean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi
On a question about sum-free sequences. Discret. Math. 200 (1-3) (1999)
Paul Erdös, András Gyárfás
Split and balanced colorings of complete graphs. Discret. Math. 200 (1-3) (1999)
Béla Bollobás, Paul Erdös, Amites Sarkar
Extremal graphs for weights. Discret. Math. 200 (1-3) (1999)
J. Adrian Bondy, Paul Erdös, Siemion Fajtlowicz
Graphs of diameter two with no 4-circuits. Discret. Math. 200 (1-3) (1999)
Paul Erdös, Péter P. Pálfy
On the orders of directly indecomposable groups. Discret. Math. 200 (1-3) (1999)
Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós
Induced subgraphs of given sizes. Discret. Math. 200 (1-3) (1999)
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) (1999)
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) (1999)
Paul Erdös, Gergely Harcos, János Pach
Popular distances in 3-space. Discret. Math. 200 (1-3) (1999)
Paul Erdös, Richard Roxby Hall
On the angular distribution of Gaussian integers with fixed norm. Discret. Math. 200 (1-3) (1999)
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) (1999)
Marc Deléglise, Paul Erdös, Jean-Louis Nicolas
. Discret. Math. 200 (1-3) (1999)
Paul Erdös, Grigori Kolesnik
Prime power divisors of binomial coefficients. Discret. Math. 200 (1-3) (1999)
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) (1999)
Paul Erdös, Tom Fowler
Finding Large p-Colored Diameter Two Subgraphs. Graphs Comb. 15 (1) (1999)
Béla Bollobás, Paul Erdös
Graphs of Extremal Weights. Ars Comb. 50 (1998)
Paul Erdös, András Gyárfás, Miklós Ruszinkó
How to decrease the diameter of triangle-free graphs. Comb. 18 (4) (1998)
Paul Erdös
Some old and new problems in various branches of combinatorics. Discret. Math. (1997)
Paul Erdös
Some recent problems and results in graph theory. Discret. Math. 164 (1-3) (1997)
Paul Erdös, Peter C. Fishburn
Minimum Planar Sets with Maximum Equidistance Counts. Comput. Geom. 7 (1997)
Paul Erdös, Gábor N. Sárközy
On cycles in the coprime graph of integers. Electron. J. Comb. 4 (2) (1997)
Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa
The size of the largest bipartite subgraphs. Discret. Math. 177 (1-3) (1997)
Paul Erdös, László Pyber
Covering a graph by complete bipartite graphs. Discret. Math. 170 (1-3) (1997)
Paul Erdös, Peter C. Fishburn
Distinct distances in finite planar sets. Discret. Math. 175 (1-3) (1997)
Paul Erdös, András Gyárfás
A Variant of the Classical Ramsey Problem. Comb. 17 (4) (1997)
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) (1997)
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) (1997)
Neil J. Calkin, Paul Erdös, Craig A. Tovey
New Ramsey Bounds from Cyclic Graphs of Prime Order. SIAM J. Discret. Math. 10 (3) (1997)
Paul Erdös, Mordechai Lewin
d-complete sequences of integers. Math. Comput. 65 (214) (1996)
Guantao Chen, Paul Erdös, William Staton
Proof of a Conjecture of Bollob's on Nested Cycles. J. Comb. Theory, Ser. B 66 (1) (1996)
Paul Erdös, András Gyárfás, Tomasz Luczak
. Discret. Math. 154 (1-3) (1996)
Paul Erdös, Zsolt Tuza, Pavel Valtr
Ramsey-remainder. Eur. J. Comb. 17 (6) (1996)
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) (1996)
Paul Erdös, Tibor Gallai, Zsolt Tuza
Covering and independence in triangle structures. Discret. Math. 150 (1-3) (1996)
Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich
-saturated graphs with restrictions on the degrees. J. Graph Theory 23 (1) (1996)
Paul Erdös, Peter C. Fishburn
Maximum planar sets that determine k distances. Discret. Math. 160 (1-3) (1996)
Paul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley
Hypercube subgraphs with minimal detours. J. Graph Theory 23 (2) (1996)
Paul Erdös, Vojtech Rödl
Covering of r-Graphs by Complete r-Partite Subgraphs. Random Struct. Algorithms 6 (2/3) (1995)
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) (1995)
Paul Erdös, Peter C. Fishburn
Intervertex Distances in Convex Polygons. Discret. Appl. Math. 60 (1-3) (1995)
Paul Erdös, Peter C. Fishburn
Multiplicities of Interpoint Distances in Finite Planar Sets. Discret. Appl. Math. 60 (1-3) (1995)
Arie Bialostocki, Paul Erdös, Hanno Lefmann
Monochromatic and zero-sum sets of nondecreasing diameter. Discret. Math. 137 (1-3) (1995)
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) (1995)
Paul Erdös, George B. Purdy
Two Combinatorial Problems in the Plane. Discret. Comput. Geom. 13 (1995)
Paul Erdös, András Sárközy, Vera T. Sós
On product representations of powers, I. Eur. J. Comb. 16 (6) (1995)
Paul Erdös, Stephen Suen, Peter Winkler
On the Size of a Random Maximal Graph. Random Struct. Algorithms 6 (2/3) (1995)
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) (1994)
Paul Erdös, Peter C. Fishburn
A Postscript on Distances in Convex n-Gons. Discret. Comput. Geom. 11 (1994)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
A local density condition for triangles. Discret. Math. 127 (1-3) (1994)
Paul Erdös, Tomasz Luczak
Change of Leadership in a Random Graph Process. Random Struct. Algorithms 5 (1) (1994)
Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
Crossing Families. Comb. 14 (2) (1994)
Paul Erdös, András Sárközy, Vera T. Sós
On additive properties of general sequences. Discret. Math. 136 (1-3) (1994)
Paul Erdös
Problems and results in discrete mathematics. Discret. Math. 136 (1-3) (1994)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau
Extremal problems and generalized degrees. Discret. Math. 127 (1-3) (1994)
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
-Independence Numbers. Comb. Probab. Comput. 3 (1994)
Paul Erdös, András Gyárfás, Tomasz Luczak
Independet Transversals in Sparse Partite Hypergraphs. Comb. Probab. Comput. 3 (1994)
Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa
The grid revisted. Discret. Math. 111 (1-3) (1993)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Ramsey Size Linear Graphs. Comb. Probab. Comput. 2 (1993)
Paul Erdös, Fred Galvin
Monochromatic infinite paths. Discret. Math. 113 (1-3) (1993)
Paul Erdös, Endre Makai, János Pach
Nearly Equal Distances in the Plane. Comb. Probab. Comput. 2 (1993)
Paul Erdös, Cecil C. Rousseau
The size Ramsey number of a complete bipartite graph. Discret. Math. 113 (1-3) (1993)
Paul Erdös, L. Bruce Richmond
On graphical partitions. Comb. 13 (1) (1993)
Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein
Clique Partitions of Chordal Graphs. Comb. Probab. Comput. 2 (1993)
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) (1993)
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) (1993)
Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West
Clique coverings of the edges of a random graph. Comb. 13 (1) (1993)
Paul Erdös, Tibor Gallai, Zsolt Tuza
Covering the cliques of a graph with vertices. Discret. Math. 108 (1-3) (1992)
Paul Erdös
An Extremal Problem. SIAM Rev. 34 (2) (1992)
Paul Erdös
In memory of Tibor Gallai. Comb. 12 (4) (1992)
Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor
Bounds for arrays of dots with distinct slopes or lengths. Comb. 12 (1) (1992)
Andreas Blass, Paul Erdös, Alan D. Taylor
Diverse Homogeneous Sets. J. Comb. Theory, Ser. A 59 (2) (1992)
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau
Extremal problems involving vertices and edges on odd cycles. Discret. Math. 101 (1-3) (1992)
Richard A. Duke, Paul Erdös, Vojtech Rödl
Cycle-connected graphs. Discret. Math. 108 (1-3) (1992)
Paul Erdös
Optimum Multiple Access Coding (D.B. Jevtić). SIAM Rev. 34 (2) (1992)
Paul Erdös, András Sárközy
Arithmetic progressions in subset sums. Discret. Math. 102 (3) (1992)
Paul Erdös, D. Frank Hsu
Distributed Loop Network with Minimum Transmission Delay. Theor. Comput. Sci. 100 (1) (1992)
Paul Erdös, Peter C. Fishburn, Zoltán Füredi
-GONS. SIAM J. Discret. Math. 4 (3) (1991)
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) (1991)
Paul Erdös, Jean A. Larson
Matchings from a set below to a set above. Discret. Math. 95 (1-3) (1991)
Paul Erdös, Siemion Fajtlowicz, William Staton
Degree sequences in triangle-free graphs. Discret. Math. 92 (1-3) (1991)
Paul Erdös, Henry A. Kierstead, William T. Trotter
The Dimension of Random Ordered Sets. Random Struct. Algorithms 2 (3) (1991)
Paul Erdös, Fred Galvin
Some Ramsey-type theorems. Discret. Math. 87 (3) (1991)
Paul Erdös, András Hajnal, Zsolt Tuza
Local constraints ensuring small representing sets. J. Comb. Theory, Ser. A 58 (1) (1991)
Paul Erdös, Zoltán Füredi, Zsolt Tuza
Saturated r-uniform hypergraphs. Discret. Math. 98 (2) (1991)
Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
Crossing Families. SCG (1991)
David Avis, Paul Erdös, János Pach
Distinct Distances Determined By Subsets of a Point Set in Space. Comput. Geom. 1 (1991)
Paul Erdös, Joel Spencer
Lopsided Lovász Local Lemma and Latin transversals. Discret. Appl. Math. 30 (2-3) (1991)
Paul Erdös, John G. Gimbel, Dieter Kratsch
Some extremal results in cochromatic and dichromatic theory. J. Graph Theory 15 (6) (1991)
Paul Erdös, John Gimbel, H. Joseph Straight
Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number. Eur. J. Comb. 11 (3) (1990)
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)
Paul Erdös, Prasad Tetali
Representations of Integers as the Sum of k Terms. Random Struct. Algorithms 1 (3) (1990)

Paul Erdös.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paul Erdös