Paul Erdős

According to our database, Paul Erdős authored at least 219 papers between 1957 and 2015.

Collaborative distances:

• Dijkstra number of three.

2015

Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors.

Steve Butler, Paul Erdös, Ron Graham

Integers, 2015

2013

Some of My Favorite Problems and Results.

Paul Erdös

Proceedings of the Mathematics of Paul Erdős I, 2013

Dense Difference Sets and Their Combinatorial Structure.

Vitaly Bergelson, Paul Erdös, Neil Hindman, Tomasz Luczak

Proceedings of the Mathematics of Paul Erdős I, 2013

2006

Extremal problems among subsets of a set.

Paul Erdös, Daniel J. Kleitman

Discret. Math., 2006

2003

On large intersecting subfamilies of uniform setfamilies.

Richard A. Duke, Paul Erdös, Vojtech Rödl

Random Struct. Algorithms, 2003

On the equality of the partial Grundy and upper ochromatic numbers of graphs.

Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, Geert C. E. Prins

Discret. Math., 2003

2002

A Ramsey-type problem and the Turán numbers.

Noga Alon, Paul Erdös, David S. Gunderson, Michael Molloy

J. Graph Theory, 2002

Random induced graphs.

Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 2002

2001

Edge disjoint monochromatic triangles in 2-colored graphs.

Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel

Discret. Math., 2001

1999

Finding Large p-Colored Diameter Two Subgraphs.

Paul Erdös, Tom Fowler

Graphs Comb., 1999

Ensembles de multiples de suites finies.

Paul Erdös, Gerald Tenenbaum

Discret. Math., 1999

On the orders of directly indecomposable groups.

Paul Erdös, Péter P. Pálfy

Discret. Math., 1999

Subsets of an interval whose product is a power.

Paul Erdös, Janice L. Malouf, John L. Selfridge, Esther Szekeres

Discret. Math., 1999

On arithmetic properties of integers with missing digits II: Prime factors.

Paul Erdös, Christian Mauduit, András Sárközy

Discret. Math., 1999

Greedy algorithm, arithmetic progressions, subset sums and divisibility.

Paul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy

Discret. Math., 1999

Prime power divisors of binomial coefficients.

Paul Erdös, Grigori Kolesnik

Discret. Math., 1999

Popular distances in 3-space.

Paul Erdös, Gergely Harcos, János Pach

Discret. Math., 1999

On the angular distribution of Gaussian integers with fixed norm.

Paul Erdös, Richard Roxby Hall

Discret. Math., 1999

Split and balanced colorings of complete graphs.

Paul Erdös, András Gyárfás

Discret. Math., 1999

Induced subgraphs of given sizes.

Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós

Discret. Math., 1999

The number of cycle lengths in graphs of given minimum degree and girth.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1999

On a question about sum-free sequences.

Jean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi

Discret. Math., 1999

Sur les ensembles représentés par les partitions d'un entier n¹.

Marc Deléglise, Paul Erdös, Jean-Louis Nicolas

Discret. Math., 1999

Graphs of diameter two with no 4-circuits.

J. Adrian Bondy, Paul Erdös, Siemion Fajtlowicz

Discret. Math., 1999

Extremal graphs for weights.

Béla Bollobás, Paul Erdös, Amites Sarkar

Discret. Math., 1999

1998

How to decrease the diameter of triangle-free graphs.

Paul Erdös, András Gyárfás, Miklós Ruszinkó

Comb., 1998

Graphs of Extremal Weights.

Béla Bollobás, Paul Erdös

Ars Comb., 1998

1997

New Ramsey Bounds from Cyclic Graphs of Prime Order.

Neil J. Calkin, Paul Erdös, Craig A. Tovey

SIAM J. Discret. Math., 1997

Intersection Statements for Systems of Sets.

Walter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer

J. Comb. Theory A, 1997

A Class of Edge Critical 4-Chromatic Graphs.

Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp

Graphs Comb., 1997

Covering a graph by complete bipartite graphs.

Paul Erdös, László Pyber

Discret. Math., 1997

The size of the largest bipartite subgraphs.

Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa

Discret. Math., 1997

Distinct distances in finite planar sets.

Paul Erdös, Peter C. Fishburn

Discret. Math., 1997

Some old and new problems in various branches of combinatorics.

Paul Erdös

Discret. Math., 1997

Some recent problems and results in graph theory.

Paul Erdös

Discret. Math., 1997

Minimum Planar Sets with Maximum Equidistance Counts.

Paul Erdös, Peter C. Fishburn

Comput. Geom., 1997

On cycles in the coprime graph of integers.

Paul Erdös, Gábor N. Sárközy

Electron. J. Comb., 1997

A Variant of the Classical Ramsey Problem.

Paul Erdös, András Gyárfás

Comb., 1997

1996

d-complete sequences of integers.

Paul Erdös, Mordechai Lewin

Math. Comput., 1996

Hypercube subgraphs with minimal detours.

Paul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley

J. Graph Theory, 1996

On <i>k</i>-saturated graphs with restrictions on the degrees.

Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich

J. Graph Theory, 1996

Proof of a Conjecture of Bollob's on Nested Cycles.

Guantao Chen, Paul Erdös, William Staton

J. Comb. Theory B, 1996

Ramsey-remainder.

Paul Erdös, Zsolt Tuza, Pavel Valtr

Eur. J. Comb., 1996

Sizes of graphs with induced subgraphs of large maximum degree.

Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton

Discret. Math., 1996

Covering and independence in triangle structures.

Paul Erdös, Tibor Gallai, Zsolt Tuza

Discret. Math., 1996

Graphs in which each C₄ spans K₄.

Paul Erdös, András Gyárfás, Tomasz Luczak

Discret. Math., 1996

Maximum planar sets that determine k distances.

Paul Erdös, Peter C. Fishburn

Discret. Math., 1996

1995

On the Size of a Random Maximal Graph.

Paul Erdös, Stephen Suen, Peter Winkler

Random Struct. Algorithms, 1995

Covering of r-Graphs by Complete r-Partite Subgraphs.

Paul Erdös, Vojtech Rödl

Random Struct. Algorithms, 1995

Extremal Graphs for Intersecting Triangles.

Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson

J. Comb. Theory B, 1995

On product representations of powers, I.

Paul Erdös, András Sárközy, Vera T. Sós

Eur. J. Comb., 1995

Degree sequence and independence in K(4)-free graphs.

Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton

Discret. Math., 1995

Monochromatic and zero-sum sets of nondecreasing diameter.

Arie Bialostocki, Paul Erdös, Hanno Lefmann

Discret. Math., 1995

Two Combinatorial Problems in the Plane.

Paul Erdös, George B. Purdy

Discret. Comput. Geom., 1995

Intervertex Distances in Convex Polygons.

Paul Erdös, Peter C. Fishburn

Discret. Appl. Math., 1995

Multiplicities of Interpoint Distances in Finite Planar Sets.

Paul Erdös, Peter C. Fishburn

Discret. Appl. Math., 1995

1994

Change of Leadership in a Random Graph Process.

Paul Erdös, Tomasz Luczak

Random Struct. Algorithms, 1994

Local and global average degree in graphs and multigraphs.

Edward A. Bertram, Paul Erdös, Peter Horák, Jozef Sirán, Zsolt Tuza

J. Graph Theory, 1994

On additive properties of general sequences.

Paul Erdös, András Sárközy, Vera T. Sós

Discret. Math., 1994

A local density condition for triangles.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1994

Extremal problems and generalized degrees.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau

Discret. Math., 1994

Problems and results in discrete mathematics.

Paul Erdös

Discret. Math., 1994

A Postscript on Distances in Convex n-Gons.

Paul Erdös, Peter C. Fishburn

Discret. Comput. Geom., 1994

Turán-Ramsey Theorems and K^p-Independence Numbers.

Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi

Comb. Probab. Comput., 1994

Independet Transversals in Sparse Partite Hypergraphs.

Paul Erdös, András Gyárfás, Tomasz Luczak

Comb. Probab. Comput., 1994

Crossing Families.

Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman

Comb., 1994

1993

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs.

Paul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp

Eur. J. Comb., 1993

The size Ramsey number of a complete bipartite graph.

Paul Erdös, Cecil C. Rousseau

Discret. Math., 1993

Monochromatic infinite paths.

Paul Erdös, Fred Galvin

Discret. Math., 1993

The grid revisted.

Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa

Discret. Math., 1993

Clique Partitions of Chordal Graphs.

Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein

Comb. Probab. Comput., 1993

Nearly Equal Distances in the Plane.

Paul Erdös, Endre Makai, János Pach

Comb. Probab. Comput., 1993

Ramsey Size Linear Graphs.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Comb. Probab. Comput., 1993

On graphical partitions.

Paul Erdös, L. Bruce Richmond

Comb., 1993

Turán-Ramsey theorems and simple asymptotically extremal structures.

Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi

Comb., 1993

Clique coverings of the edges of a random graph.

Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West

Comb., 1993

1992

Distributed Loop Network with Minimum Transmission Delay.

Paul Erdös, D. Frank Hsu

Theor. Comput. Sci., 1992

Optimum Multiple Access Coding (D.B. Jevtić).

Paul Erdös

SIAM Rev., 1992

An Extremal Problem.

Paul Erdös

SIAM Rev., 1992

Diverse Homogeneous Sets.

Andreas Blass, Paul Erdös, Alan D. Taylor

J. Comb. Theory A, 1992

Arithmetic progressions in subset sums.

Paul Erdös, András Sárközy

Discret. Math., 1992

Covering the cliques of a graph with vertices.

Paul Erdös, Tibor Gallai, Zsolt Tuza

Discret. Math., 1992

Extremal problems involving vertices and edges on odd cycles.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau

Discret. Math., 1992

Cycle-connected graphs.

Richard A. Duke, Paul Erdös, Vojtech Rödl

Discret. Math., 1992

Bounds for arrays of dots with distinct slopes or lengths.

Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor

Comb., 1992

In memory of Tibor Gallai.

Paul Erdös

Comb., 1992

1991

Midpoints of Diagonals of Convex <i>n</i>-GONS.

Paul Erdös, Peter C. Fishburn, Zoltán Füredi

SIAM J. Discret. Math., 1991

The Dimension of Random Ordered Sets.

Paul Erdös, Henry A. Kierstead, William T. Trotter

Random Struct. Algorithms, 1991

Some extremal results in cochromatic and dichromatic theory.

Paul Erdös, John G. Gimbel, Dieter Kratsch

J. Graph Theory, 1991

Local constraints ensuring small representing sets.

Paul Erdös, András Hajnal, Zsolt Tuza

J. Comb. Theory A, 1991

Vertex coverings by monochromatic cycles and trees.

Paul Erdös, András Gyárfás, László Pyber

J. Comb. Theory B, 1991

Matchings from a set below to a set above.

Paul Erdös, Jean A. Larson

Discret. Math., 1991

Some Ramsey-type theorems.

Paul Erdös, Fred Galvin

Discret. Math., 1991

Saturated r-uniform hypergraphs.

Paul Erdös, Zoltán Füredi, Zsolt Tuza

Discret. Math., 1991

Degree sequences in triangle-free graphs.

Paul Erdös, Siemion Fajtlowicz, William Staton

Discret. Math., 1991

Lopsided Lovász Local Lemma and Latin transversals.

Paul Erdös, Joel Spencer

Discret. Appl. Math., 1991

Distinct Distances Determined By Subsets of a Point Set in Space.

David Avis, Paul Erdös, János Pach

Comput. Geom., 1991

1990

Representations of Integers as the Sum of k Terms.

Paul Erdös, Prasad Tetali

Random Struct. Algorithms, 1990

Quasi-progressions and descending waves.

Tom C. Brown, Paul Erdös, Allen R. Freedman

J. Comb. Theory A, 1990

Colouring prime distance graphs.

Roger B. Eggleton, Paul Erdös, D. K. Skilton

Graphs Comb., 1990

Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number.

Paul Erdös, John Gimbel, H. Joseph Straight

Eur. J. Comb., 1990

Subgraphs of minimal degree k.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1990

Countable Decompositions of R² and R³.

Paul Erdös, Péter Komjáth

Discret. Comput. Geom., 1990

Variation on the theme of repeated distances.

Paul Erdös, János Pach

Comb., 1990

Gaps in Difference Sets, and the Graph of Nearly Equal Distances.

Paul Erdös, Endre Makai, János Pach, Joel H. Spencer

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989

Tight bounds on the chromatic sum of a connected graph.

Carsten Thomassen, Paul Erdös, Yousef Alavi, Paresh J. Malde, Allen J. Schwenk

J. Graph Theory, 1989

Domination in colored complete graphs.

Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp

J. Graph Theory, 1989

Representations of graphs and orthogonal latin square graphs.

Paul Erdös, Anthony B. Evans

J. Graph Theory, 1989

Maximal antiramsey graphs and the strong chromatic number.

Stefan A. Burr, Paul Erdös, Ronald L. Graham, Vera T. Sós

J. Graph Theory, 1989

Monochromatic sumsets.

Paul Erdös, Joel H. Spencer

J. Comb. Theory A, 1989

Radius, diameter, and minimum degree.

Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza

J. Comb. Theory B, 1989

On the number of partitions of n without a given subsum (I).

Paul Erdös, Jean-Louis Nicolas, András Sárközy

Discret. Math., 1989

On the number of distinct induced subgraphs of a graph.

Paul Erdös, András Hajnal

Discret. Math., 1989

On the Graph of Large Distance.

Paul Erdös, László Lovász, Katalin Vesztergombi

Discret. Comput. Geom., 1989

Disjoint Edges in Geometric Graphs.

Noga Alon, Paul Erdös

Discret. Comput. Geom., 1989

Ramsey-type theorems.

Paul Erdös, András Hajnal

Discret. Appl. Math., 1989

The size of chordal, interval and threshold subgraphs.

Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein

Comb., 1989

1988

Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays.

Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks

Math. Syst. Theory, 1988

Cutting a graph into two dissimilar halves.

Paul Erdös, Mark Goldberg, János Pach, Joel Spencer

J. Graph Theory, 1988

A tribute to Torrence Parsons.

Paul Erdös

J. Graph Theory, 1988

Graphs with unavoidable subgraphs with large degrees.

Lou Caccetta, Paul Erdös, K. Vijayan

J. Graph Theory, 1988

How to make a graph bipartite.

Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer

J. Comb. Theory B, 1988

Repeated distances in space.

David Avis, Paul Erdös, János Pach

Graphs Comb., 1988

Intersection Graphs for Families of Balls in Rⁿ.

Paul Erdös, Chris D. Godsil, Steven G. Krantz, Torrence D. Parsons

Eur. J. Comb., 1988

Extremal theory and bipartite graph-tree Ramsey numbers.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1988

Clique partitions and clique coverings.

Paul Erdös, Ralph J. Faudree, Edward T. Ordman

Discret. Math., 1988

Problems and results in combinatorial analysis and graph theory.

Paul Erdös

Discret. Math., 1988

Optima of dual integer linear programs.

Ron Aharoni, Paul Erdös, Nathan Linial

Comb., 1988

On Admissible Constellations of Consecutive Primes.

Paul Erdös, Hans Riesel

BIT, 1988

1987

On the equality of the grundy and ochromatic numbers of a graph.

Paul Erdös, W. R. Hare, Stephen T. Hedetniemi, Renu C. Laskar

J. Graph Theory, 1987

On unavoidable hypergraphs.

Fan R. K. Chung, Paul Erdös

J. Graph Theory, 1987

Highly irregular graphs.

Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann

J. Graph Theory, 1987

Goodness of trees for generalized books.

Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson

Graphs Comb., 1987

k-Connectivity in Random Graphs.

Paul Erdös, J. W. Kennedy

Eur. J. Comb., 1987

Extremal problems on permutations under cyclic equivalence.

Paul Erdös, Nathan Linial, Shlomo Moran

Discret. Math., 1987

A Ramsey problem of Harary on graphs with prescribed size.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1987

1986

Maximum induced trees in graphs.

Paul Erdös, Michael E. Saks, Vera T. Sós

J. Comb. Theory B, 1986

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent.

Paul Erdös, Peter Frankl, Vojtech Rödl

Graphs Comb., 1986

Two problems in extremal graph theory.

Paul Erdös

Graphs Comb., 1986

Coloring graphs with locally few colors.

Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress

Discret. Math., 1986

Clique numbers of graphs.

Paul Erdös, Marcel Erné

Discret. Math., 1986

On some metric and combinatorial geometric problems.

Paul Erdös

Discret. Math., 1986

Extremal clique coverings of complementary graphs.

D. de Caen, Paul Erdös, Norman J. Pullmann, Nicholas C. Wormald

Comb., 1986

1985

Ulam, the man and the mathematician.

Paul Erdös

J. Graph Theory, 1985

On 2-Designs.

Paul Erdös, Joel C. Fowler, Vera T. Sós, Richard M. Wilson

J. Comb. Theory A, 1985

Colouring the real line.

Roger B. Eggleton, Paul Erdös, D. K. Skilton

J. Comb. Theory B, 1985

Extremal subgraphs for two graphs.

Fan R. K. Chung, Paul Erdös, Joel H. Spencer

J. Comb. Theory B, 1985

Quantitative Forms of a Theorem of Hilbert.

Tom C. Brown, Paul Erdös, Fan R. K. Chung, Ronald L. Graham

J. Comb. Theory A, 1985

Notes of welcome.

Claude Berge, Paul Erdös, Sin Hitotumatu, Loo Keng Hua, Richard Rado

Graphs Comb., 1985

An Application of Graph Theory to Additive Number Theory.

Noga Alon, Paul Erdös

Eur. J. Comb., 1985

A note on the interval number of a graph.

Paul Erdös, Douglas B. West

Discret. Math., 1985

Chromatic number of finite and infinite graphs and hypergraphs.

Paul Erdös, András Hajnal

Discret. Math., 1985

Multipartite graph - space graph Ramsey numbers.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Comb., 1985

On the existence of two non-neighboring subgraphs in a graph.

Mohamed M. El-Zahar, Paul Erdös

Comb., 1985

Dual Integer Linear Programs and the Relationship between their Optima

Ron Aharoni, Paul Erdös, Nathan Linial

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Bounds on threshold dimension and disjoint threshold coverings (abstract only).

Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein

Proceedings of the 13th ACM Annual Conference on Computer Science, 1985

1984

Addendum to "trees in random graphs".

Paul Erdös, Zbigniew Palka

Discret. Math., 1984

Enumeration of intersecting families.

Paul Erdös, Neil Hindman

Discret. Math., 1984

1983

Local connectivity of a random graph.

Paul Erdös, Edgar M. Palmer, Robert W. Robinson

J. Graph Theory, 1983

On a Quasi-Ramsey problem.

Paul Erdös, János Pach

J. Graph Theory, 1983

Generalizations of a Ramsey-theoretic result of chvátal.

Stefan A. Burr, Paul Erdös

J. Graph Theory, 1983

Trees in random graphs.

Paul Erdös, Zbigniew Palka

Discret. Math., 1983

Finite linear spaces and projective planes.

Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson

Discret. Math., 1983

Supersaturated graphs and hypergraphs.

Paul Erdös, Miklós Simonovits

Comb., 1983

More results on Ramsey - Turán Type problems.

Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi

Comb., 1983

On unavoidable graphs.

Fan R. K. Chung, Paul Erdös

Comb., 1983

1982

Graphs with certain families of spanning trees.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

J. Comb. Theory B, 1982

Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.

Paul Erdös, Peter Frankl, Zoltán Füredi

J. Comb. Theory A, 1982

Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs.

Fan R. K. Chung, Paul Erdös, Ronald L. Graham

J. Comb. Theory A, 1982

On a problem in combinatorial geometry.

Paul Erdös, George B. Purdy, Ernst G. Straus

Discret. Math., 1982

Disjoint cliques and disjoint maximal independent sets of vertices in graphs.

Paul Erdös, Arthur M. Hobbs, C. Payan

Discret. Math., 1982

Ramsey-minimal graphs for forests.

Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1982

On Ramsey - Turán type theorems for hypergraphs.

Paul Erdös, Vera T. Sós

Comb., 1982

Compactness results in extremal graph theory.

Paul Erdös, Miklós Simonovits

Comb., 1982

Personal reminiscences and remarks on the mathematical work of Tibor Gallai.

Paul Erdös

Comb., 1982

1981

Some Bounds for the Ramsey-Paris-Harrington Numbers.

Paul Erdös, George Mills

J. Comb. Theory A, 1981

Ramsey-minimal graphs for star-forests.

Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Discret. Math., 1981

On the conjecture of Hajós.

Paul Erdös, Siemion Fajtlowicz

Comb., 1981

On the combinatorial problems which I would most like to see solved.

Paul Erdös

Comb., 1981

Minimal decompositions of graphs into mutually isomorphic subgraphs.

Fan R. K. Chung, Paul Erdös, Ronald L. Graham

Comb., 1981

On Turáns theorem for sparse graphs.

Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi

Comb., 1981

Sets of natural numbers of positive density and cylindric set algebras of dimension 2.

Paul Erdös, Vance Faber, Jean Larson

Algebra Universalis, 1981

1980

Random Graph Isomorphism.

László Babai, Paul Erdös, Stanley M. Selkow

SIAM J. Comput., 1980

Maximum degree in graphs of diameter 2.

Paul Erdös, Siemion Fajtlowicz, Alan J. Hoffman

Networks, 1980

Some Applications of Ramsey's Theorem to Additive Number Theory.

Paul Erdös

Eur. J. Comb., 1980

Hadwiger's Conjecture is True for Almost Every Graph.

Béla Bollobás, Paul A. Catlin, Paul Erdös

Eur. J. Comb., 1980

On a problem of L. Fejes Tóth.

Paul Erdös, János Pach

Discret. Math., 1980

1978

When the cartesian product of directed cycles is Hamiltonian.

William T. Trotter, Paul Erdös

J. Graph Theory, 1978

A class of Hamiltonian regular graphs.

Paul Erdös, Arthur M. Hobbs

J. Graph Theory, 1978

On cycle - Complete graph ramsey numbers.

Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

J. Graph Theory, 1978

Combinatorial Properties of Systems of Sets.

Paul Erdös, Endre Szemerédi

J. Comb. Theory A, 1978

Some Combinatorial Problems in the Plane.

Paul Erdös, George B. Purdy

J. Comb. Theory A, 1978

On finite superuniversal graphs.

Paul Erdös, Stephen H. Hechler, Paul C. Kainen

Discret. Math., 1978

On additive partitions of integers.

Krishnaswami Alladi, Paul Erdös, V. E. Hoggatt Jr.

Discret. Math., 1978

1977

Paul Turán, 1910-1976: His work in graph theory.

Paul Erdös

J. Graph Theory, 1977

A note of welcome.

Paul Erdös

J. Graph Theory, 1977

On the chromatic index of almost all graphs.

Paul Erdös, Robin J. Wilson

J. Comb. Theory B, 1977

Hamiltonian cycles in regular graphs of moderate degree.

Paul Erdös, Arthur M. Hobbs

J. Comb. Theory B, 1977

On a problem in extremal graph theory.

D. T. Busolini, Paul Erdös

J. Comb. Theory B, 1977

On total matching numbers and total covering numbers of complementary graphs.

Paul Erdös, Amram Meir

Discret. Math., 1977

1976

Partition Theorems for Subsets of Vector Spaces.

Marshall L. Cates, Paul Erdös, Neil Hindman, Bruce Rothschild

J. Comb. Theory A, 1976

On a Ramsey-Turán type problem.

Béla Bollobás, Paul Erdös

J. Comb. Theory B, 1976

1975

On Packing Squares with Equal Squares.

Paul Erdös, Ronald L. Graham

J. Comb. Theory A, 1975

Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n.

Michel Deza, Paul Erdös

Discret. Math., 1975

On complete subgraphs of r-chromatic graphs.

Béla Bollobás, Paul Erdös, Endre Szemerédi

Discret. Math., 1975

1974

Remark on a Theorem of Lindström.

Paul Erdös

J. Comb. Theory A, 1974

On the connection between chromatic number, maximal clique and minimal degree of a graph.

B. Andrásfai, Paul Erdös, Vera T. Sós

Discret. Math., 1974

1973

On a Combinatorial Game.

Paul Erdös, John L. Selfridge

J. Comb. Theory A, 1973

Euclidean Ramsey Theorems I.

Paul Erdös, Ronald L. Graham, Peter Montgomery, Bruce Lee Rothschild, Joel Spencer, Ernst G. Straus

J. Comb. Theory A, 1973

On a valence problem in extremal graph theory.

Paul Erdös, Miklós Simonovits

Discret. Math., 1973

On a generalization of Ramsey numbers.

Paul Erdös, Patrik E. O'Neil

Discret. Math., 1973

1972

Separability properties of almost — disjoint families of sets.

Paul Erdős, Saharon Shelah

Israel Journal of Mathematics, March, 1972

On some applications of graph theory, I.

Paul Erdös, Amram Meir, Vera T. Sós, Paul Turán

Discret. Math., 1972

Ramsey's theorem and self-complementary graphs.

Vasek Chvátal, Paul Erdös, Z. Hedrlín

Discret. Math., 1972

A note on Hamiltonian circuits.

Vasek Chvátal, Paul Erdös

Discret. Math., 1972

1971

Imbalances in k-colorations.

Paul Erdös, Joel H. Spencer

Networks, 1971

On some extremal problems on r-graphs.

Paul Erdös

Discret. Math., 1971

1959

Elementary Divisors of Normal Matrices.

Paul Erdös

IBM J. Res. Dev., 1959

1957

Sur la décomposition de l'espace euclidien en ensembles homogènes.

Paul Erdős, Solomon Marcus

Acta Mathematica Hungarica, 1957