The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Paul Erdös" ( http://dblp.L3S.de/Authors/Paul_Erdös )

URL (Homepage):  http://en.wikipedia.org/wiki/Paul_Erdos  Author page on DBLP  Author page in RDF  Community of Paul Erdös in ASPL-2

Publication years (Num. hits)
1973-1981 (18) 1982-1984 (15) 1985-1986 (16) 1987-1989 (19) 1990-1991 (17) 1992-1993 (19) 1994-1995 (17) 1996-1997 (17) 1998-1999 (18) 2001-2006 (6)
Publication types (Num. hits)
article(159) inproceedings(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords

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