| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Paul Erdös, A. Meir, Vera T. Sós, P. Turán |
On some applications of graph theory, I.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Daniel J. Kleitman |
Extremal problems among subsets of a set.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard A. Duke, Paul Erdös, Vojtech Rödl |
On large intersecting subfamilies of uniform setfamilies.  |
Random Struct. Algorithms  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp |
Random induced graphs.  |
Discrete Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel |
Edge disjoint monochromatic triangles in 2-colored graphs.  |
Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós |
Induced subgraphs of given sizes.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Gerald Tenenbaum |
Ensembles de multiples de suites finies.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi |
On a question about sum-free sequences.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás |
Split and balanced colorings of complete graphs.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Deléglise, Paul Erdös, Jean-Louis Nicolas |
Sur les ensembles représentés par les partitions d'un entier n1.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Paul Erdös, Amites Sarkar |
Extremal graphs for weights.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Janice L. Malouf, J. L. Selfridge, Esther Szekeres |
Subsets of an interval whose product is a power.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Richard Roxby Hall |
On the angular distribution of Gaussian integers with fixed norm.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Gergely Harcos, János Pach |
Popular distances in 3-space.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | John Adrian Bondy, Paul Erdös, Siemion Fajtlowicz |
Graphs of diameter two with no 4-circuits.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Christian Mauduit, András Sárközy |
On arithmetic properties of integers with missing digits II: Prime factors.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Péter P. Pálfy |
On the orders of directly indecomposable groups.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Grigori Kolesnik |
Prime power divisors of binomial coefficients.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Tom Fowler |
Finding Large p-Colored Diameter Two Subgraphs.  |
Graphs and Combinatorics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Miklós Ruszinkó |
How to decrease the diameter of triangle-free graphs.  |
Combinatorica  |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C12, 05C35 |
| 1 | Béla Bollobás, Paul Erdös |
Graphs of Extremal Weights.  |
Ars Comb.  |
1998 |
DBLP BibTeX RDF |
|
| 1 | 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  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Peter C. Fishburn |
Distinct distances in finite planar sets.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös |
Some recent problems and results in graph theory.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa |
The size of the largest bipartite subgraphs.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, László Pyber |
Covering a graph by complete bipartite graphs.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös |
Some old and new problems in various branches of combinatorics.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Gábor N. Sárközy |
On cycles in the coprime graph of integers.  |
Electr. J. Comb.  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás |
A Variant of the Classical Ramsey Problem.  |
Combinatorica  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil J. Calkin, Paul Erdös, Craig A. Tovey |
New Ramsey Bounds from Cyclic Graphs of Prime Order.  |
SIAM J. Discrete Math.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Peter C. Fishburn |
Minimum Planar Sets with Maximum Equidistance Counts.  |
Comput. Geom.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Paul Erdös, William Staton |
Proof of a Conjecture of Bollob's on Nested Cycles.  |
J. Comb. Theory, Ser. B  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Peter C. Fishburn |
Maximum planar sets that determine k distances.  |
Discrete Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Tomasz Luczak |
Graphs in which each C4 spans K4.  |
Discrete Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Tibor Gallai, Zsolt Tuza |
Covering and independence in triangle structures.  |
Discrete Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton |
Sizes of graphs with induced subgraphs of large maximum degree.  |
Discrete Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Zsolt Tuza, Pavel Valtr |
Ramsey-remainder.  |
Eur. J. Comb.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Mordechai Lewin |
d-complete sequences of integers.  |
Math. Comput.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson |
Extremal Graphs for Intersecting Triangles.  |
J. Comb. Theory, Ser. B  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Bialostocki, Paul Erdös, Hanno Lefmann |
Monochromatic and zero-sum sets of nondecreasing diameter.  |
Discrete Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Vojtech Rödl |
Covering of r-Graphs by Complete r-Partite Subgraphs.  |
Random Struct. Algorithms  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Stephen Suen, Peter Winkler |
On the Size of a Random Maximal Graph.  |
Random Struct. Algorithms  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, George B. Purdy |
Two Combinatorial Problems in the Plane.  |
Discrete & Computational Geometry  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Peter C. Fishburn |
Intervertex Distances in Convex Polygons.  |
Discrete Applied Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Peter C. Fishburn |
Multiplicities of Interpoint Distances in Finite Planar Sets.  |
Discrete Applied Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau |
Extremal problems and generalized degrees.  |
Discrete Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp |
A local density condition for triangles.  |
Discrete Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös |
Problems and results in discrete mathematics.  |
Discrete Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Sárközy, Vera T. Sós |
On additive properties of general sequences.  |
Discrete Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Tomasz Luczak |
Change of Leadership in a Random Graph Process.  |
Random Struct. Algorithms  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Tomasz Luczak |
Independet Transversals in Sparse Partite Hypergraphs.  |
Combinatorics, Probability & Computing  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman |
Crossing Families.  |
Combinatorica  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Peter C. Fishburn |
A Postscript on Distances in Convex n-Gons.  |
Discrete & Computational Geometry  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa |
The grid revisted.  |
Discrete Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Cecil C. Rousseau |
The size Ramsey number of a complete bipartite graph.  |
Discrete Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Fred Galvin |
Monochromatic infinite paths.  |
Discrete Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös |
The Giant Component 1960-1993.  |
Random Struct. Algorithms  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Paul Erdös, Endre Makai, János Pach |
Nearly Equal Distances in the Plane.  |
Combinatorics, Probability & Computing  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein |
Clique Partitions of Chordal Graphs.  |
Combinatorics, Probability & Computing  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp |
Ramsey Size Linear Graphs.  |
Combinatorics, Probability & Computing  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West |
Clique coverings of the edges of a random graph.  |
Combinatorica  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, L. Bruce Richmond |
On graphical partitions.  |
Combinatorica  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Paul Erdös, Alan D. Taylor |
Diverse Homogeneous Sets.  |
J. Comb. Theory, Ser. A  |
1992 |
DBLP BibTeX RDF |
|
| 1 | Paul Erdös, D. Frank Hsu |
Distributed Loop Network with Minimum Transmission Delay.  |
Theor. Comput. Sci.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Tibor Gallai, Zsolt Tuza |
Covering the cliques of a graph with vertices.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard A. Duke, Paul Erdös, Vojtech Rödl |
Cycle-connected graphs.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Sárközy |
Arithmetic progressions in subset sums.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau |
Extremal problems involving vertices and edges on odd cycles.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös |
In memory of Tibor Gallai.  |
Combinatorica  |
1992 |
DBLP BibTeX RDF |
|
| 1 | Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor |
Bounds for arrays of dots with distinct slopes or lengths.  |
Combinatorica  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal, Zsolt Tuza |
Local constraints ensuring small representing sets.  |
J. Comb. Theory, Ser. A  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, László Pyber |
Vertex coverings by monochromatic cycles and trees.  |
J. Comb. Theory, Ser. B  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Zoltán Füredi, Zsolt Tuza |
Saturated r-uniform hypergraphs.  |
Discrete Mathematics  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Siemion Fajtlowicz, William Staton |
Degree sequences in triangle-free graphs.  |
Discrete Mathematics  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Jean A. Larson |
Matchings from a set below to a set above.  |
Discrete Mathematics  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Fred Galvin |
Some Ramsey-type theorems.  |
Discrete Mathematics  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Henry A. Kierstead, William T. Trotter |
The Dimension of Random Ordered Sets.  |
Random Struct. Algorithms  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Peter C. Fishburn, Zoltán Füredi |
Midpoints of Diagonals of Convex n-GONS.  |
SIAM J. Discrete Math.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | David Avis, Paul Erdös, János Pach |
Distinct Distances Determined By Subsets of a Point Set in Space.  |
Comput. Geom.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Joel Spencer |
Lopsided Lovász Local Lemma and Latin transversals.  |
Discrete Applied Mathematics  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom C. Brown, Paul Erdös, Allen R. Freedman |
Quasi-progressions and descending waves.  |
J. Comb. Theory, Ser. A  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp |
Subgraphs of minimal degree k.  |
Discrete Mathematics  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Prasad Tetali |
Representations of Integers as the Sum of k Terms.  |
Random Struct. Algorithms  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Roger B. Eggleton, Paul Erdös, D. K. Skilton |
Colouring prime distance graphs.  |
Graphs and Combinatorics  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, János Pach |
Variation on the theme of repeated distances.  |
Combinatorica  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Péter Komjáth |
Countable Decompositions of R2 and R3.  |
Discrete & Computational Geometry  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza |
Radius, diameter, and minimum degree.  |
J. Comb. Theory, Ser. B  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Joel H. Spencer |
Monochromatic sumsets.  |
J. Comb. Theory, Ser. A  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal |
On the number of distinct induced subgraphs of a graph.  |
Discrete Mathematics  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein |
The size of chordal, interval and threshold subgraphs.  |
Combinatorica  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, László Lovász, Katalin Vesztergombi |
On the Graph of Large Distance.  |
Discrete & Computational Geometry  |
1989 |
DBLP DOI BibTeX RDF |
|