Paul Erdös - RankMe

219 papers A* 1Journal 213Unranked 3

Year	Rank	Type	Title / Venue / Authors
2015	J	`jnl`	Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors. Integers Steve Butler, Paul Erdös, Ron Graham
2013	—	`ch.`	Dense Difference Sets and Their Combinatorial Structure. The Mathematics of Paul Erdős I Vitaly Bergelson, Paul Erdös, Neil Hindman, Tomasz Luczak
2013	—	`ch.`	Some of My Favorite Problems and Results. The Mathematics of Paul Erdős I Paul Erdös
2006	J	`jnl`	Extremal problems among subsets of a set. Discret. Math. Paul Erdös, Daniel J. Kleitman
2006	J	`jnl`	On some applications of graph theory, I. Discret. Math. Paul Erdös, Amram Meir, Vera T. Sós, Paul Turán
2003	J	`jnl`	On large intersecting subfamilies of uniform setfamilies. Random Struct. Algorithms Richard A. Duke, Paul Erdös, Vojtech Rödl
2003	J	`jnl`	On the equality of the partial Grundy and upper ochromatic numbers of graphs. Discret. Math. Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, Geert C. E. Prins
2002	J	`jnl`	A Ramsey-type problem and the Turán numbers. J. Graph Theory Noga Alon, Paul Erdös, David S. Gunderson, Michael Molloy
2002	J	`jnl`	Random induced graphs. Discret. Math. Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
2001	J	`jnl`	Edge disjoint monochromatic triangles in 2-colored graphs. Discret. Math. Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel
1999	J	`jnl`	Ensembles de multiples de suites finies. Discret. Math. Paul Erdös, Gerald Tenenbaum
1999	J	`jnl`	Extremal graphs for weights. Discret. Math. Béla Bollobás, Paul Erdös, Amites Sarkar
1999	J	`jnl`	Finding Large p-Colored Diameter Two Subgraphs. Graphs Comb. Paul Erdös, Tom Fowler
1999	J	`jnl`	Graphs of diameter two with no 4-circuits. Discret. Math. J. Adrian Bondy, Paul Erdös, Siemion Fajtlowicz
1999	J	`jnl`	Greedy algorithm, arithmetic progressions, subset sums and divisibility. Discret. Math. Paul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy
1999	J	`jnl`	Induced subgraphs of given sizes. Discret. Math. Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós
1999	J	`jnl`	On a question about sum-free sequences. Discret. Math. Jean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi
1999	J	`jnl`	On arithmetic properties of integers with missing digits II: Prime factors. Discret. Math. Paul Erdös, Christian Mauduit, András Sárközy
1999	J	`jnl`	On the angular distribution of Gaussian integers with fixed norm. Discret. Math. Paul Erdös, Richard Roxby Hall
1999	J	`jnl`	On the orders of directly indecomposable groups. Discret. Math. Paul Erdös, Péter P. Pálfy
1999	J	`jnl`	Popular distances in 3-space. Discret. Math. Paul Erdös, Gergely Harcos, János Pach
1999	J	`jnl`	Prime power divisors of binomial coefficients. Discret. Math. Paul Erdös, Grigori Kolesnik
1999	J	`jnl`	Split and balanced colorings of complete graphs. Discret. Math. Paul Erdös, András Gyárfás
1999	J	`jnl`	Subsets of an interval whose product is a power. Discret. Math. Paul Erdös, Janice L. Malouf, John L. Selfridge, Esther Szekeres
1999	J	`jnl`	Sur les ensembles représentés par les partitions d'un entier n Discret. Math. Marc Deléglise, Paul Erdös, Jean-Louis Nicolas
1999	J	`jnl`	The number of cycle lengths in graphs of given minimum degree and girth. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1998	J	`jnl`	Graphs of Extremal Weights. Ars Comb. Béla Bollobás, Paul Erdös
1998	J	`jnl`	How to decrease the diameter of triangle-free graphs. Comb. Paul Erdös, András Gyárfás, Miklós Ruszinkó
1997	J	`jnl`	A Class of Edge Critical 4-Chromatic Graphs. Graphs Comb. Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp
1997	J	`jnl`	A Variant of the Classical Ramsey Problem. Comb. Paul Erdös, András Gyárfás
1997	J	`jnl`	Covering a graph by complete bipartite graphs. Discret. Math. Paul Erdös, László Pyber
1997	J	`jnl`	Distinct distances in finite planar sets. Discret. Math. Paul Erdös, Peter C. Fishburn
1997	J	`jnl`	Intersection Statements for Systems of Sets. J. Comb. Theory A Walter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer
1997	J	`jnl`	Minimum Planar Sets with Maximum Equidistance Counts. Comput. Geom. Paul Erdös, Peter C. Fishburn
1997	J	`jnl`	New Ramsey Bounds from Cyclic Graphs of Prime Order. SIAM J. Discret. Math. Neil J. Calkin, Paul Erdös, Craig A. Tovey
1997	J	`jnl`	On cycles in the coprime graph of integers. Electron. J. Comb. Paul Erdös, Gábor N. Sárközy
1997	J	`jnl`	Some old and new problems in various branches of combinatorics. Discret. Math. Paul Erdös
1997	J	`jnl`	Some recent problems and results in graph theory. Discret. Math. Paul Erdös
1997	J	`jnl`	The size of the largest bipartite subgraphs. Discret. Math. Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa
1996	J	`jnl`	Covering and independence in triangle structures. Discret. Math. Paul Erdös, Tibor Gallai, Zsolt Tuza
1996	J	`jnl`	Graphs in which each C Discret. Math. Paul Erdös, András Gyárfás, Tomasz Luczak
1996	J	`jnl`	Hypercube subgraphs with minimal detours. J. Graph Theory Paul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley
1996	J	`jnl`	Maximum planar sets that determine k distances. Discret. Math. Paul Erdös, Peter C. Fishburn
1996	J	`jnl`	On J. Graph Theory Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich
1996	J	`jnl`	Proof of a Conjecture of Bollob's on Nested Cycles. J. Comb. Theory B Guantao Chen, Paul Erdös, William Staton
1996	J	`jnl`	Ramsey-remainder. Eur. J. Comb. Paul Erdös, Zsolt Tuza, Pavel Valtr
1996	J	`jnl`	Sizes of graphs with induced subgraphs of large maximum degree. Discret. Math. Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton
1996	J	`jnl`	d-complete sequences of integers. Math. Comput. Paul Erdös, Mordechai Lewin
1995	J	`jnl`	Covering of r-Graphs by Complete r-Partite Subgraphs. Random Struct. Algorithms Paul Erdös, Vojtech Rödl
1995	J	`jnl`	Degree sequence and independence in K(4)-free graphs. Discret. Math. Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton
1995	J	`jnl`	Extremal Graphs for Intersecting Triangles. J. Comb. Theory B Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson
1995	J	`jnl`	Intervertex Distances in Convex Polygons. Discret. Appl. Math. Paul Erdös, Peter C. Fishburn
1995	J	`jnl`	Monochromatic and zero-sum sets of nondecreasing diameter. Discret. Math. Arie Bialostocki, Paul Erdös, Hanno Lefmann
1995	J	`jnl`	Multiplicities of Interpoint Distances in Finite Planar Sets. Discret. Appl. Math. Paul Erdös, Peter C. Fishburn
1995	J	`jnl`	On product representations of powers, I. Eur. J. Comb. Paul Erdös, András Sárközy, Vera T. Sós
1995	J	`jnl`	On the Size of a Random Maximal Graph. Random Struct. Algorithms Paul Erdös, Stephen Suen, Peter Winkler
1995	J	`jnl`	Two Combinatorial Problems in the Plane. Discret. Comput. Geom. Paul Erdös, George B. Purdy
1994	J	`jnl`	A Postscript on Distances in Convex n-Gons. Discret. Comput. Geom. Paul Erdös, Peter C. Fishburn
1994	J	`jnl`	A local density condition for triangles. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1994	J	`jnl`	Change of Leadership in a Random Graph Process. Random Struct. Algorithms Paul Erdös, Tomasz Luczak
1994	J	`jnl`	Crossing Families. Comb. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
1994	J	`jnl`	Extremal problems and generalized degrees. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau
1994	J	`jnl`	Independet Transversals in Sparse Partite Hypergraphs. Comb. Probab. Comput. Paul Erdös, András Gyárfás, Tomasz Luczak
1994	J	`jnl`	Local and global average degree in graphs and multigraphs. J. Graph Theory Edward A. Bertram, Paul Erdös, Peter Horák, Jozef Sirán, Zsolt Tuza
1994	J	`jnl`	On additive properties of general sequences. Discret. Math. Paul Erdös, András Sárközy, Vera T. Sós
1994	J	`jnl`	Problems and results in discrete mathematics. Discret. Math. Paul Erdös
1994	J	`jnl`	Turán-Ramsey Theorems and K Comb. Probab. Comput. Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
1993	J	`jnl`	Clique Partitions of Chordal Graphs. Comb. Probab. Comput. Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein
1993	J	`jnl`	Clique coverings of the edges of a random graph. Comb. Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West
1993	J	`jnl`	Monochromatic infinite paths. Discret. Math. Paul Erdös, Fred Galvin
1993	J	`jnl`	Nearly Equal Distances in the Plane. Comb. Probab. Comput. Paul Erdös, Endre Makai, János Pach
1993	J	`jnl`	On graphical partitions. Comb. Paul Erdös, L. Bruce Richmond
1993	J	`jnl`	Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs. Eur. J. Comb. Paul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp
1993	J	`jnl`	Ramsey Size Linear Graphs. Comb. Probab. Comput. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1993	J	`jnl`	The grid revisted. Discret. Math. Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa
1993	J	`jnl`	The size Ramsey number of a complete bipartite graph. Discret. Math. Paul Erdös, Cecil C. Rousseau
1993	J	`jnl`	Turán-Ramsey theorems and simple asymptotically extremal structures. Comb. Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
1992	J	`jnl`	An Extremal Problem. SIAM Rev. Paul Erdös
1992	J	`jnl`	Arithmetic progressions in subset sums. Discret. Math. Paul Erdös, András Sárközy
1992	J	`jnl`	Bounds for arrays of dots with distinct slopes or lengths. Comb. Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor
1992	J	`jnl`	Covering the cliques of a graph with vertices. Discret. Math. Paul Erdös, Tibor Gallai, Zsolt Tuza
1992	J	`jnl`	Cycle-connected graphs. Discret. Math. Richard A. Duke, Paul Erdös, Vojtech Rödl
1992	J	`jnl`	Distributed Loop Network with Minimum Transmission Delay. Theor. Comput. Sci. Paul Erdös, D. Frank Hsu
1992	J	`jnl`	Diverse Homogeneous Sets. J. Comb. Theory A Andreas Blass, Paul Erdös, Alan D. Taylor
1992	J	`jnl`	Extremal problems involving vertices and edges on odd cycles. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau
1992	J	`jnl`	In memory of Tibor Gallai. Comb. Paul Erdös
1992	J	`jnl`	Optimum Multiple Access Coding (D.B. Jevtić). SIAM Rev. Paul Erdös
1991	—	`conf`	Crossing Families. SCG Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
1991	J	`jnl`	Degree sequences in triangle-free graphs. Discret. Math. Paul Erdös, Siemion Fajtlowicz, William Staton
1991	J	`jnl`	Distinct Distances Determined By Subsets of a Point Set in Space. Comput. Geom. David Avis, Paul Erdös, János Pach
1991	J	`jnl`	Local constraints ensuring small representing sets. J. Comb. Theory A Paul Erdös, András Hajnal, Zsolt Tuza
1991	J	`jnl`	Lopsided Lovász Local Lemma and Latin transversals. Discret. Appl. Math. Paul Erdös, Joel Spencer
1991	J	`jnl`	Matchings from a set below to a set above. Discret. Math. Paul Erdös, Jean A. Larson
1991	J	`jnl`	Midpoints of Diagonals of Convex SIAM J. Discret. Math. Paul Erdös, Peter C. Fishburn, Zoltán Füredi
1991	J	`jnl`	Saturated r-uniform hypergraphs. Discret. Math. Paul Erdös, Zoltán Füredi, Zsolt Tuza
1991	J	`jnl`	Some Ramsey-type theorems. Discret. Math. Paul Erdös, Fred Galvin
1991	J	`jnl`	Some extremal results in cochromatic and dichromatic theory. J. Graph Theory Paul Erdös, John G. Gimbel, Dieter Kratsch
1991	J	`jnl`	The Dimension of Random Ordered Sets. Random Struct. Algorithms Paul Erdös, Henry A. Kierstead, William T. Trotter
1991	J	`jnl`	Vertex coverings by monochromatic cycles and trees. J. Comb. Theory B Paul Erdös, András Gyárfás, László Pyber
1990	J	`jnl`	Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number. Eur. J. Comb. Paul Erdös, John Gimbel, H. Joseph Straight
1990	J	`jnl`	Colouring prime distance graphs. Graphs Comb. Roger B. Eggleton, Paul Erdös, D. K. Skilton
1990	J	`jnl`	Countable Decompositions of R Discret. Comput. Geom. Paul Erdös, Péter Komjáth
1990	—	`conf`	Gaps in Difference Sets, and the Graph of Nearly Equal Distances. Applied Geometry And Discrete Mathematics Paul Erdös, Endre Makai, János Pach, Joel H. Spencer
1990	J	`jnl`	Quasi-progressions and descending waves. J. Comb. Theory A Tom C. Brown, Paul Erdös, Allen R. Freedman
1990	J	`jnl`	Representations of Integers as the Sum of k Terms. Random Struct. Algorithms Paul Erdös, Prasad Tetali
1990	J	`jnl`	Subgraphs of minimal degree k. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1990	J	`jnl`	Variation on the theme of repeated distances. Comb. Paul Erdös, János Pach
1989	J	`jnl`	Disjoint Edges in Geometric Graphs. Discret. Comput. Geom. Noga Alon, Paul Erdös
1989	J	`jnl`	Domination in colored complete graphs. J. Graph Theory Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp
1989	J	`jnl`	Maximal antiramsey graphs and the strong chromatic number. J. Graph Theory Stefan A. Burr, Paul Erdös, Ronald L. Graham, Vera T. Sós
1989	J	`jnl`	Monochromatic sumsets. J. Comb. Theory A Paul Erdös, Joel H. Spencer
1989	J	`jnl`	On the Graph of Large Distance. Discret. Comput. Geom. Paul Erdös, László Lovász, Katalin Vesztergombi
1989	J	`jnl`	On the number of distinct induced subgraphs of a graph. Discret. Math. Paul Erdös, András Hajnal
1989	J	`jnl`	On the number of partitions of n without a given subsum (I). Discret. Math. Paul Erdös, Jean-Louis Nicolas, András Sárközy
1989	J	`jnl`	Radius, diameter, and minimum degree. J. Comb. Theory B Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza
1989	J	`jnl`	Ramsey-type theorems. Discret. Appl. Math. Paul Erdös, András Hajnal
1989	J	`jnl`	Representations of graphs and orthogonal latin square graphs. J. Graph Theory Paul Erdös, Anthony B. Evans
1989	J	`jnl`	The size of chordal, interval and threshold subgraphs. Comb. Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein
1989	J	`jnl`	Tight bounds on the chromatic sum of a connected graph. J. Graph Theory Carsten Thomassen, Paul Erdös, Yousef Alavi, Paresh J. Malde, Allen J. Schwenk
1988	J	`jnl`	A tribute to Torrence Parsons. J. Graph Theory Paul Erdös
1988	J	`jnl`	Clique partitions and clique coverings. Discret. Math. Paul Erdös, Ralph J. Faudree, Edward T. Ordman
1988	J	`jnl`	Cutting a graph into two dissimilar halves. J. Graph Theory Paul Erdös, Mark Goldberg, János Pach, Joel Spencer
1988	J	`jnl`	Extremal theory and bipartite graph-tree Ramsey numbers. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1988	J	`jnl`	Graphs with unavoidable subgraphs with large degrees. J. Graph Theory Lou Caccetta, Paul Erdös, K. Vijayan
1988	J	`jnl`	How to make a graph bipartite. J. Comb. Theory B Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer
1988	J	`jnl`	Intersection Graphs for Families of Balls in R Eur. J. Comb. Paul Erdös, Chris D. Godsil, Steven G. Krantz, Torrence D. Parsons
1988	J	`jnl`	Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. Math. Syst. Theory Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks
1988	J	`jnl`	On Admissible Constellations of Consecutive Primes. BIT Paul Erdös, Hans Riesel
1988	J	`jnl`	Optima of dual integer linear programs. Comb. Ron Aharoni, Paul Erdös, Nathan Linial
1988	J	`jnl`	Problems and results in combinatorial analysis and graph theory. Discret. Math. Paul Erdös
1988	J	`jnl`	Repeated distances in space. Graphs Comb. David Avis, Paul Erdös, János Pach
1987	J	`jnl`	A Ramsey problem of Harary on graphs with prescribed size. Discret. Math. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1987	J	`jnl`	Extremal problems on permutations under cyclic equivalence. Discret. Math. Paul Erdös, Nathan Linial, Shlomo Moran
1987	J	`jnl`	Goodness of trees for generalized books. Graphs Comb. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson
1987	J	`jnl`	Highly irregular graphs. J. Graph Theory Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann
1987	J	`jnl`	On the equality of the grundy and ochromatic numbers of a graph. J. Graph Theory Paul Erdös, W. R. Hare, Stephen T. Hedetniemi, Renu C. Laskar
1987	J	`jnl`	On unavoidable hypergraphs. J. Graph Theory Fan R. K. Chung, Paul Erdös
1987	J	`jnl`	k-Connectivity in Random Graphs. Eur. J. Comb. Paul Erdös, J. W. Kennedy
1986	J	`jnl`	Clique numbers of graphs. Discret. Math. Paul Erdös, Marcel Erné
1986	J	`jnl`	Coloring graphs with locally few colors. Discret. Math. Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress
1986	J	`jnl`	Extremal clique coverings of complementary graphs. Comb. D. de Caen, Paul Erdös, Norman J. Pullmann, Nicholas C. Wormald
1986	J	`jnl`	Maximum induced trees in graphs. J. Comb. Theory B Paul Erdös, Michael E. Saks, Vera T. Sós
1986	J	`jnl`	On some metric and combinatorial geometric problems. Discret. Math. Paul Erdös
1986	J	`jnl`	The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Comb. Paul Erdös, Peter Frankl, Vojtech Rödl
1986	J	`jnl`	Two problems in extremal graph theory. Graphs Comb. Paul Erdös
1985	J	`jnl`	A note on the interval number of a graph. Discret. Math. Paul Erdös, Douglas B. West
1985	J	`jnl`	An Application of Graph Theory to Additive Number Theory. Eur. J. Comb. Noga Alon, Paul Erdös
1985	—	`conf`	Bounds on threshold dimension and disjoint threshold coverings (abstract only). ACM Conference on Computer Science Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein
1985	J	`jnl`	Chromatic number of finite and infinite graphs and hypergraphs. Discret. Math. Paul Erdös, András Hajnal
1985	J	`jnl`	Colouring the real line. J. Comb. Theory B Roger B. Eggleton, Paul Erdös, D. K. Skilton
1985	A*	`conf`	Dual Integer Linear Programs and the Relationship between their Optima STOC Ron Aharoni, Paul Erdös, Nathan Linial
1985	J	`jnl`	Extremal subgraphs for two graphs. J. Comb. Theory B Fan R. K. Chung, Paul Erdös, Joel H. Spencer
1985	J	`jnl`	Multipartite graph - space graph Ramsey numbers. Comb. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1985	J	`jnl`	Notes of welcome. Graphs Comb. Claude Berge, Paul Erdös, Sin Hitotumatu, Loo Keng Hua, Richard Rado
1985	J	`jnl`	On 2-Designs. J. Comb. Theory A Paul Erdös, Joel C. Fowler, Vera T. Sós, Richard M. Wilson
1985	J	`jnl`	On the existence of two non-neighboring subgraphs in a graph. Comb. Mohamed M. El-Zahar, Paul Erdös
1985	J	`jnl`	Quantitative Forms of a Theorem of Hilbert. J. Comb. Theory A Tom C. Brown, Paul Erdös, Fan R. K. Chung, Ronald L. Graham
1985	J	`jnl`	Ulam, the man and the mathematician. J. Graph Theory Paul Erdös
1984	J	`jnl`	Addendum to "trees in random graphs". Discret. Math. Paul Erdös, Zbigniew Palka
1984	J	`jnl`	Enumeration of intersecting families. Discret. Math. Paul Erdös, Neil Hindman
1983	J	`jnl`	Finite linear spaces and projective planes. Discret. Math. Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson
1983	J	`jnl`	Generalizations of a Ramsey-theoretic result of chvátal. J. Graph Theory Stefan A. Burr, Paul Erdös
1983	J	`jnl`	Local connectivity of a random graph. J. Graph Theory Paul Erdös, Edgar M. Palmer, Robert W. Robinson
1983	J	`jnl`	More results on Ramsey - Turán Type problems. Comb. Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi
1983	J	`jnl`	On a Quasi-Ramsey problem. J. Graph Theory Paul Erdös, János Pach
1983	J	`jnl`	On unavoidable graphs. Comb. Fan R. K. Chung, Paul Erdös
1983	J	`jnl`	Supersaturated graphs and hypergraphs. Comb. Paul Erdös, Miklós Simonovits
1983	J	`jnl`	Trees in random graphs. Discret. Math. Paul Erdös, Zbigniew Palka
1982	J	`jnl`	Compactness results in extremal graph theory. Comb. Paul Erdös, Miklós Simonovits
1982	J	`jnl`	Disjoint cliques and disjoint maximal independent sets of vertices in graphs. Discret. Math. Paul Erdös, Arthur M. Hobbs, C. Payan
1982	J	`jnl`	Families of Finite Sets in Which No Set Is Covered by the Union of Two Others. J. Comb. Theory A Paul Erdös, Peter Frankl, Zoltán Füredi
1982	J	`jnl`	Graphs with certain families of spanning trees. J. Comb. Theory B Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1982	J	`jnl`	Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs. J. Comb. Theory A Fan R. K. Chung, Paul Erdös, Ronald L. Graham
1982	J	`jnl`	On Ramsey - Turán type theorems for hypergraphs. Comb. Paul Erdös, Vera T. Sós
1982	J	`jnl`	On a problem in combinatorial geometry. Discret. Math. Paul Erdös, George B. Purdy, Ernst G. Straus
1982	J	`jnl`	Personal reminiscences and remarks on the mathematical work of Tibor Gallai. Comb. Paul Erdös
1982	J	`jnl`	Ramsey-minimal graphs for forests. Discret. Math. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1981	J	`jnl`	Minimal decompositions of graphs into mutually isomorphic subgraphs. Comb. Fan R. K. Chung, Paul Erdös, Ronald L. Graham
1981	J	`jnl`	On Turáns theorem for sparse graphs. Comb. Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi
1981	J	`jnl`	On the combinatorial problems which I would most like to see solved. Comb. Paul Erdös
1981	J	`jnl`	On the conjecture of Hajós. Comb. Paul Erdös, Siemion Fajtlowicz
1981	J	`jnl`	Ramsey-minimal graphs for star-forests. Discret. Math. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1981	J	`jnl`	Some Bounds for the Ramsey-Paris-Harrington Numbers. J. Comb. Theory A Paul Erdös, George Mills
1980	J	`jnl`	Hadwiger's Conjecture is True for Almost Every Graph. Eur. J. Comb. Béla Bollobás, Paul A. Catlin, Paul Erdös
1980	J	`jnl`	Maximum degree in graphs of diameter 2. Networks Paul Erdös, Siemion Fajtlowicz, Alan J. Hoffman
1980	J	`jnl`	On a problem of L. Fejes Tóth. Discret. Math. Paul Erdös, János Pach
1980	J	`jnl`	Random Graph Isomorphism. SIAM J. Comput. László Babai, Paul Erdös, Stanley M. Selkow
1980	J	`jnl`	Some Applications of Ramsey's Theorem to Additive Number Theory. Eur. J. Comb. Paul Erdös
1978	J	`jnl`	A class of Hamiltonian regular graphs. J. Graph Theory Paul Erdös, Arthur M. Hobbs
1978	J	`jnl`	Combinatorial Properties of Systems of Sets. J. Comb. Theory A Paul Erdös, Endre Szemerédi
1978	J	`jnl`	On additive partitions of integers. Discret. Math. Krishnaswami Alladi, Paul Erdös, V. E. Hoggatt Jr.
1978	J	`jnl`	On cycle - Complete graph ramsey numbers. J. Graph Theory Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
1978	J	`jnl`	On finite superuniversal graphs. Discret. Math. Paul Erdös, Stephen H. Hechler, Paul C. Kainen
1978	J	`jnl`	Some Combinatorial Problems in the Plane. J. Comb. Theory A Paul Erdös, George B. Purdy
1978	J	`jnl`	When the cartesian product of directed cycles is Hamiltonian. J. Graph Theory William T. Trotter, Paul Erdös
1977	J	`jnl`	A note of welcome. J. Graph Theory Paul Erdös
1977	J	`jnl`	Hamiltonian cycles in regular graphs of moderate degree. J. Comb. Theory B Paul Erdös, Arthur M. Hobbs
1977	J	`jnl`	On a problem in extremal graph theory. J. Comb. Theory B D. T. Busolini, Paul Erdös
1977	J	`jnl`	On the chromatic index of almost all graphs. J. Comb. Theory B Paul Erdös, Robin J. Wilson
1977	J	`jnl`	On total matching numbers and total covering numbers of complementary graphs. Discret. Math. Paul Erdös, Amram Meir
1977	J	`jnl`	Paul Turán, 1910-1976: His work in graph theory. J. Graph Theory Paul Erdös
1976	J	`jnl`	On a Ramsey-Turán type problem. J. Comb. Theory B Béla Bollobás, Paul Erdös
1976	J	`jnl`	Partition Theorems for Subsets of Vector Spaces. J. Comb. Theory A Marshall L. Cates, Paul Erdös, Neil Hindman, Bruce Rothschild
1975	J	`jnl`	Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n. Discret. Math. Michel Deza, Paul Erdös
1975	J	`jnl`	On Packing Squares with Equal Squares. J. Comb. Theory A Paul Erdös, Ronald L. Graham
1975	J	`jnl`	On complete subgraphs of r-chromatic graphs. Discret. Math. Béla Bollobás, Paul Erdös, Endre Szemerédi
1974	J	`jnl`	Extremal problems among subsets of a set. Discret. Math. Paul Erdös, Daniel J. Kleitman
1974	J	`jnl`	On the connection between chromatic number, maximal clique and minimal degree of a graph. Discret. Math. B. Andrásfai, Paul Erdös, Vera T. Sós
1974	J	`jnl`	Remark on a Theorem of Lindström. J. Comb. Theory A Paul Erdös
1973	J	`jnl`	Euclidean Ramsey Theorems I. J. Comb. Theory A Paul Erdös, Ronald L. Graham, Peter Montgomery, Bruce Lee Rothschild, Joel Spencer, Ernst G. Straus
1973	J	`jnl`	On a Combinatorial Game. J. Comb. Theory A Paul Erdös, John L. Selfridge
1973	J	`jnl`	On a generalization of Ramsey numbers. Discret. Math. Paul Erdös, Patrik E. O'Neil
1973	J	`jnl`	On a valence problem in extremal graph theory. Discret. Math. Paul Erdös, Miklós Simonovits
1972	J	`jnl`	A note on Hamiltonian circuits. Discret. Math. Vasek Chvátal, Paul Erdös
1972	J	`jnl`	On some applications of graph theory, I. Discret. Math. Paul Erdös, Amram Meir, Vera T. Sós, Paul Turán
1972	J	`jnl`	Ramsey's theorem and self-complementary graphs. Discret. Math. Vasek Chvátal, Paul Erdös, Z. Hedrlín
1971	J	`jnl`	Imbalances in k-colorations. Networks Paul Erdös, Joel H. Spencer
1971	J	`jnl`	On some extremal problems on r-graphs. Discret. Math. Paul Erdös
1959	J	`jnl`	Elementary Divisors of Normal Matrices. IBM J. Res. Dev. Paul Erdös