Paul Erdös

发表

Graphs of Extremal Weights

Béla Bollobás, Paul Erdös, B. Bollobás, 1998, Ars Comb..

Monochromatic infinite paths

Paul Erdös, Fred Galvin, 1993, Discret. Math..

Highly irregular graphs

Paul Erdös, Fan Chung Graham, Ronald L. Graham, 1987, J. Graph Theory.

Quasi-progressions and descending waves

Paul Erdös, Tom C. Brown, Allen R. Freedman, 1990, J. Comb. Theory, Ser. A.

Advanced Problems: 5397,5410- 5419

Paul Erdös, H. W. Guggenheimer, Azreil Rosenfeld, 1966 .

Intersection Graphs for Families of Balls in Rn

Chris D. Godsil, Paul Erdös, Steven G. Krantz, 1988, Eur. J. Comb..

On additive partitions of integers

Paul Erdös, Krishnaswami Alladi, V. E. Hoggatt, 1978, Discret. Math..

Clique coverings of the edges of a random graph

Béla Bollobás, Paul Erdös, Joel H. Spencer, 1993, Comb..

Some extremal results in cochromatic and dichromatic theory

Paul Erdös, Dieter Kratsch, John G. Gimbel, 1991, J. Graph Theory.

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

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

On 2-Designs

Paul Erdös, Richard M. Wilson, Vera T. Sós, 1985, J. Comb. Theory, Ser. A.

Independet Transversals in Sparse Partite Hypergraphs

Paul Erdös, Tomasz Luczak, András Gyárfás, 1994, Comb. Probab. Comput..

Extremal problems among subsets of a set

Paul Erdös, Daniel J. Kleitman, P. Erdös, 1974, Discret. Math..

Sizes of graphs with induced subgraphs of large maximum degree

Richard H. Schelp, Paul Erdös, Talmage James Reid, 1996, Discret. Math..

Covering of r-Graphs by Complete r-Partite Subgraphs

Vojtech Rödl, Paul Erdös, 1995, Random Struct. Algorithms.

Problems for Solution: 4412-4414

Paul Erdös, Jacques Dutka, Lucien Droussent, 1950 .

On some applications of graph theory, I

Paul Erdös, Vera T. Sós, Amram Meir, 1972, Discrete Mathematics.

Ramsey-minimal graphs for forests

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1982, Discret. Math..

Coloring graphs with locally few colors

Vojtech Rödl, Zoltán Füredi, Paul Erdös, 1986, Discret. Math..

Problems for Solution: 4528-4532

Paul Erdös, Victor Thebault, Leonard Carlitz, 1953 .

A note of welcome

Paul Erdös, 1977, J. Graph Theory.

On some metric and combinatorial geometric problems

Paul Erdös, P. Erdös, 1986, Discret. Math..

On a problem in combinatorial geometry

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

A note on the interval number of a graph

Paul Erdös, Douglas B. West, P. Erdös, 1985, Discret. Math..

A Ramsey-type problem and the Turán numbers

Noga Alon, Paul Erdös, Michael Molloy, 2002, J. Graph Theory.

On a Ramsey-Turán type problem

Béla Bollobás, Paul Erdös, B. Bollobás, 1976, Journal of combinatorial theory. Series B (Print).

On random graphs, I

Paul Erdös, P. Erdös, 1959 .

On the graph of large distances

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

Change of Leadership in a Random Graph Process

Paul Erdös, Tomasz Luczak, 1994, Random Struct. Algorithms.

Extremal theory and bipartite graph-tree Ramsey numbers

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1988, Discret. Math..

When the cartesian product of directed cycles is Hamiltonian

Paul Erdös, William T. Trotter, P. Erdös, 1978, J. Graph Theory.

Local connectivity of a random graph

Paul Erdös, Edgar M. Palmer, Robert W. Robinson, 1983, J. Graph Theory.

ON THE PRODUCT OF THE POINT AND LINE COVERING NUMBERS OF A GRAPH

Paul Erdös, Ronald L. Graham, Fan Chung, 1979 .

Some applications of graph theory to number theory

Paul Erdös, P. Erdös, 1969 .

Covering the cliques of a graph with vertices

Zsolt Tuza, Paul Erdös, Tibor Gallai, 1992, Discret. Math..

Notes of welcome

Paul Erdös, Claude Berge, Sin Hitotumatu, 1985, Graphs Comb..

Some Ramsey-type theorems

Paul Erdös, Fred Galvin, P. Erdös, 1991, Discret. Math..

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

Paul Erdös, Mohamed M. El-Zahar, P. Erdös, 1985, Comb..

Partition Theorems for Subsets of Vector Spaces

Paul Erdös, Bruce Rothschild, Neil Hindman, 1976, J. Comb. Theory, Ser. A.

Goodness of trees for generalized books

Richard H. Schelp, Paul Erdös, Michael S. Jacobson, 1987, Graphs Comb..

Diverse Homogeneous Sets

Paul Erdös, Andreas Blass, Alan D. Taylor, 1992, J. Comb. Theory, Ser. A.

SOME COMBINATORIAL PROBLEMS IN THE PLANE

Paul Erdös, George B. Purdy, P. Erdös, 1978, J. Comb. Theory, Ser. A.

Ramsey-type theorems

Paul Erdös, András Hajnal, P. Erdös, 1989, Discret. Appl. Math..

Trees in random graphs

Paul Erdös, Zbigniew Palka, 1983, Discret. Math..

An Application of Graph Theory to Additive Number Theory

Noga Alon, Paul Erdös, N. Alon, 1985, Eur. J. Comb..

Repeated distances in space

Paul Erdös, János Pach, David Avis, 1988, Graphs Comb..

The Dimension of Random Ordered Sets

Paul Erdös, Hal A. Kierstead, William T. Trotter, 1991, Random Struct. Algorithms.

Domination in colored complete graphs

Richard H. Schelp, Paul Erdös, András Gyárfás, 1989, J. Graph Theory.

Degree sequences in triangle-free graphs

Paul Erdös, Siemion Fajtlowicz, William Staton, 1991, Discret. Math..

Saturated r-uniform hypergraphs

Zsolt Tuza, Zoltán Füredi, Paul Erdös, 1991, Discret. Math..

New Ramsey Bounds from Cyclic Graphs of Prime Order

Paul Erdös, Craig A. Tovey, Neil J. Calkin, 1997, SIAM J. Discret. Math..

A class of Hamiltonian regular graphs

Paul Erdös, Arthur M. Hobbs, P. Erdös, 1978, J. Graph Theory.

On an extremal problem

Paul Erdös, P. Nevai, 1979 .

Ramsey-minimal graphs for star-forests

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1981, Discret. Math..

Popular distances in 3-space

Paul Erdös, János Pach, Gergely Harcos, 1999, Discret. Math..

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

Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, 1987, J. Graph Theory.

Matchings from a set below to a set above

Paul Erdös, Jean A. Larson, 1991, Discret. Math..

On cycles in the coprime graph of integers

Paul Erdös, Gábor N. Sárközy, P. Erdös, 1996, Electron. J. Comb..

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

Richard H. Schelp, Paul Erdös, Talmage James Reid, 1995, Discret. Math..

On unavoidable graphs

Paul Erdös, Fan Chung Graham, 1983, Comb..

Personal reminiscences and remarks on the mathematical work of Tibor Gallai

Paul Erdös, P. Erdös, 1982, Comb..

On Packing Squares with Equal Squares

Paul Erdös, Ronald L. Graham, R. Graham, 1975, J. Comb. Theory, Ser. A.

Colouring the real line

Paul Erdös, Roger B. Eggleton, D. K. Skilton, 1985, J. Comb. Theory B.

Local constraints ensuring small representing sets

Zsolt Tuza, Paul Erdös, András Hajnal, 1991, J. Comb. Theory, Ser. A.

Nearly Equal Distances in the Plane

Paul Erdös, János Pach, Endre Makai, 1993, Comb. Probab. Comput..

Split and balanced colorings of complete graphs

Paul Erdös, András Gyárfás, P. Erdös, 1999, Discret. Math..

Elementary Divisors of Normal Matrices

Paul Erdös, 1959, IBM J. Res. Dev..

Some old and new problems in various branches of combinatorics

Paul Erdös, P. Erdös, 1997, Discret. Math..

Maximum planar sets that determine k distances

Peter C. Fishburn, Paul Erdös, 1996, Discret. Math..

On Turán’s theorem for sparse graphs

János Komlós, Endre Szemerédi, Paul Erdös, 1981, Comb..

Random Graph Isomorphism

Paul Erdös, László Babai, Stanley M. Selkow, 1980, SIAM J. Comput..

In memory of Tibor Gallai

Paul Erdös, 1992, Comb..

Computer simulation of the motor-neural system of a simple invertebrate

Paul Erdös, Ernst Niebur, 1988 .

Covering a graph by complete bipartite graphs

Paul Erdös, László Pyber, 1997, Discret. Math..

Some Applications of Ramsey's Theorem to Additive Number Theory

Paul Erdös, 1980, Eur. J. Comb..

Problems for Solution: 4911-4916

Paul Erdös, Solomon W. Golomb, Leo Moser, 1960 .

A note on Hamiltonian circuits

Paul Erdös, Vasek Chvátal, P. Erdös, 1972, Discret. Math..

Hadwiger's Conjecture is True for Almost Every Graph

Béla Bollobás, Paul Erdös, Paul A. Catlin, 1980, Eur. J. Comb..

Turán-Ramsey theorems and simple asymptotically extremal structures

Miklós Simonovits, Endre Szemerédi, Paul Erdös, 1993, Comb..

k-Connectivity in Random Graphs

Paul Erdös, J. W. Kennedy, 1987, Eur. J. Comb..

Combinatorial Properties of Systems of Sets

Endre Szemerédi, Paul Erdös, 1978, J. Comb. Theory, Ser. A.

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

Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, 2003, Discret. Math..

Intersection Statements for Systems of Sets

Alexandr V. Kostochka, Paul Erdös, David S. Gunderson, 1997, J. Comb. Theory, Ser. A.

Edge disjoint monochromatic triangles in 2-colored graphs

Paul Erdös, Michael S. Jacobson, Ralph J. Faudree, 2001, Discret. Math..

Lopsided Lovász Local Lemma and Latin transversals

Paul Erdös, Joel H. Spencer, J. Spencer, 1991, Discret. Appl. Math..

Elementary Problems: E3243-E3248

Paul Erdös, Solomon W. Golomb, Lee A. Rubel, 1988 .

On unavoidable hypergraphs

Paul Erdös, Fan Chung Graham, 1987, J. Graph Theory.

Cycle-connected graphs

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

Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays

Israel Koren, Paul Erdös, Shmuel Zaks, 2005, Mathematical systems theory.

Colouring prime distance graphs

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

Hypercube subgraphs with minimal detours

William D. Weakley, Paul Erdös, Peter Hamburger, 1996, J. Graph Theory.

Enumeration of intersecting families

Paul Erdös, Neil Hindman, 1984, Discret. Math..

Monochromatic sumsets

Paul Erdös, Joel H. Spencer, 1989, J. Comb. Theory, Ser. A.

Quantitative Forms of a Theorem of Hilbert

Paul Erdös, Fan Chung Graham, Ronald L. Graham, 1985, J. Comb. Theory, Ser. A.

Turán-Ramsey Theorems and Kp-Independence Numbers

Miklós Simonovits, Endre Szemerédi, Paul Erdös, 1994, Combinatorics, Probability and Computing.

Extremal problems involving vertices and edges on odd cycles

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

Generalizations of a Ramsey-theoretic result of chvátal

Paul Erdös, Stefan A. Burr, 1983, J. Graph Theory.

On additive properties of general sequences

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

Greedy algorithm, arithmetic progressions, subset sums and divisibility

Paul Erdös, András Sárközy, Vsevolod F. Lev, 1999, Discret. Math..

Problems: 10282-10289

Feng Luo, Paul Erdös, Richard Stong, 1993 .

On Pisier Type Problems and Results (Combinatorial Applications to Number Theory)

Paul Erdös, Vojtěch Rödl, Jaroslav Nešetřil, 1990 .

The size of chordal, interval and threshold subgraphs

Paul Erdös, Yechezkel Zalcstein, András Gyárfás, 1989, Comb..

On the chromatic index of almost all graphs

Paul Erdös, Robin J. Wilson, P. Erdös, 1977, J. Comb. Theory, Ser. B.

Problems: 10290-10297

Paul Erdös, Derek A. Holton, Moshe Rosenfeld, 1993 .

Problems for Solution: 4350-4354

Paul Erdös, Victor Klee, Victor Thebault, 1949 .

Problems for Solution: 4070-4074

Paul Erdös, Richard Bellman, Victor Thebault, 1943 .

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

Paul Erdös, Yechezkel Zalcstein, Edward T. Ordman, 1985, CSC '85.

Optima of dual integer linear programs

Paul Erdös, Nathan Linial, Ron Aharoni, 1988, Comb..

On a Quasi-Ramsey problem

Paul Erdös, János Pach, 1983, J. Graph Theory.

Problems for Solution: E741-E745

Paul Erdös, Victor Thebault, E. P. Starke, 1946 .

Extremal problems among subsets of a set

Paul Erdös, Daniel J. Kleitman, 2006, Discret. Math..

Extremal Graphs for Intersecting Triangles

Zoltán Füredi, Paul Erdös, David S. Gunderson, 1995, J. Comb. Theory, Ser. B.

Representations of Integers as the Sum of k Terms

Paul Erdös, Prasad Tetali, P. Erdös, 1990, Random Struct. Algorithms.

Graphs in which each C4 spans K4

Paul Erdös, Tomasz Luczak, András Gyárfás, 1996, Discret. Math..

Crossing families

Wayne Goddard, Paul Erdös, Boris Aronov, 1991, SCG '91.

Finding Large p-Colored Diameter Two Subgraphs

Paul Erdös, Tom Fowler, P. Erdös, 1999, Graphs Comb..

Two problems in extremal graph theory

Paul Erdös, 1986, Graphs Comb..

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

Paul Erdös, András Sárközy, Jean-Louis Nicolas, 1989, Discret. Math..

Disjoint edges in geometric graphs

Noga Alon, Paul Erdös, N. Alon, 1989, Discret. Comput. Geom..

Some recent problems and results in graph theory

Paul Erdös, P. Erdös, 1997, Discret. Math..

Maximum degree in graphs of diameter 2

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

Extremal clique coverings of complementary graphs

Paul Erdös, Nicholas C. Wormald, Dominique de Caen, 1986, Comb..

On cycle - Complete graph ramsey numbers

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1978, J. Graph Theory.

On a valence problem in extremal graph theory

Miklós Simonovits, Paul Erdös, P. Erdös, 1973, Discret. Math..

Dense Difference Sets and Their Combinatorial Structure

Paul Erdös, Neil Hindman, Tomasz Luczak, 2013, The Mathematics of Paul Erdős I.

Problems for Solutions: 4390-4394

Paul Erdös, Victor Thebault, H. F. Sandham, 1950 .

On some extremal problems on r-graphs

Paul Erdös, P. Erdös, 1971, Discret. Math..

On admissible constellations of consecutive primes

Paul Erdös, Hans Riesel, P. Erdös, 1988, BIT.

Euclidean Ramsey Theorems I

Paul Erdös, Joel H. Spencer, Bruce Rothschild, 1973, J. Comb. Theory, Ser. A.

A tribute to Torrence Parsons

Paul Erdös, 1988, J. Graph Theory.

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

Paul Erdös, András Sárközy, Christian Mauduit, 1999, Discret. Math..

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

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1999, Discret. Math..

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

Paul Erdös, P. Erdös, 1977, J. Graph Theory.

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

Vojtech Rödl, Paul Erdös, Peter Frankl, 1986, Graphs Comb..

Problems for Solution: 3847-3850

Paul Erdös, Victor Thebault, N. A. Court, 1937 .

Supersaturated graphs and hypergraphs

Miklós Simonovits, Paul Erdös, P. Erdös, 1983, Comb..

A local density condition for triangles

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1994, Discret. Math..

On a question about sum-free sequences

Paul Erdös, Giuseppe Melfi, Jean-Marc Deshouillers, 1999, Discret. Math..

Extremal subgraphs for two graphs

Paul Erdös, Joel H. Spencer, Fan Chung Graham, 1985, J. Comb. Theory, Ser. B.

On the conjecture of hajós

Paul Erdös, Siemion Fajtlowicz, P. Erdös, 1981, Comb..

Midpoints of Diagonals of Convex n-GONS

Zoltán Füredi, Peter C. Fishburn, Paul Erdös, 1991, SIAM J. Discret. Math..

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

Paul Erdös, Joel H. Spencer, János Pach, 1990, Applied Geometry And Discrete Mathematics.

Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number

Paul Erdös, John Gimbel, H. Joseph Straight, 1990, Eur. J. Comb..

Some of My Favorite Problems and Results

Paul Erdös, 2013, The Mathematics of Paul Erdős I.

Proof of a Conjecture of Bollob's on Nested Cycles

Paul Erdös, William Staton, Guantao Chen, 1996, J. Comb. Theory, Ser. B.

Problems for Solution: 4336-4340

Paul Erdös, N. S. Mendelsohn, Orrin Frink, 1949 .

Graphs with certain families of spanning trees

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1982, J. Comb. Theory, Ser. B.

Sur les ensembles représentés par les partitions d'un entier n1

Paul Erdös, Marc Deléglise, Jean-Louis Nicolas, 1999, Discrete Mathematics.

On complete subgraphs of r-chromatic graphs

Endre Szemerédi, Béla Bollobás, Paul Erdös, 1975, Discret. Math..

Local and global average degree in graphs and multigraphs

Zsolt Tuza, Paul Erdös, Jozef Sirán, 1994, J. Graph Theory.

On Ramsey—Turán type theorems for hypergraphs

Paul Erdös, Vera T. Sós, V. Sós, 1982, Comb..

Elementary Problems: E2938-E2943

Paul Erdös, Eric Anderson, Andrew Leonard, 1982 .

Distinct distances in finite planar sets

Peter C. Fishburn, Paul Erdös, 1997, Discret. Math..

Clique numbers of graphs

Paul Erdös, Marcel Erné, 1986, Discret. Math..

Problems and Solution: 4225-4228

Paul Erdös, Victor Thebault, H. F. Sandham, 1946 .

Minimal decompositions of graphs into mutually isomorphic subgraphs

Paul Erdös, Fan Chung Graham, Ronald L. Graham, 1981, Comb..

Representations of graphs and orthogonal latin square graphs

Paul Erdös, Anthony B. Evans, P. Erdös, 1989, J. Graph Theory.

Disjoint cliques and disjoint maximal independent sets of vertices in graphs

Paul Erdös, Arthur M. Hobbs, C. Payan, 1982, Discret. Math..

On the Size of a Random Maximal Graph

Peter Winkler, Paul Erdös, Stephen Suen, 1995, Random Struct. Algorithms.

On graphical partitions

Paul Erdös, L. Bruce Richmond, 1993, Comb..

On the number of distinct induced subgraphs of a graph

Paul Erdös, András Hajnal, P. Erdös, 1989, Discret. Math..

Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs

Paul Erdös, Fan Chung Graham, Ronald L. Graham, 1982, J. Comb. Theory, Ser. A.

On a generalization of Ramsey numbers

Paul Erdös, Patrik E. O'Neil, P. Erdös, 1973, Discret. Math..

The grid revisted

Zoltán Füredi, Paul Erdös, János Pach, 1993, Discret. Math..

Problems: 10184-10192

Paul Erdös, Dragomir Z. Dokovic, William C. Waterhouse, 1992 .

Some Bounds for the Ramsey-Paris-Harrington Numbers

Paul Erdös, George Mills, P. Erdös, 1981, J. Comb. Theory, Ser. A.

Multipartite graph—Sparse graph Ramsey numbers

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1985, Comb..

Dual integer linear programs and the relationship between their optima

Paul Erdös, Nathan Linial, Ron Aharoni, 1985, STOC '85.

Imbalances in k-colorations

Paul Erdös, Joel H. Spencer, J. Spencer, 1971, Networks.

Chromatic number of finite and infinite graphs and hypergraphs

Paul Erdös, András Hajnal, P. Erdös, 1985, Discret. Math..

Problems and Results on Random Walks

Paul Erdös, Pál Révész, P. Révész, 1987 .

Compactness results in extremal graph theory

Miklós Simonovits, Paul Erdös, P. Erdös, 1982, Comb..

How to decrease the diameter of triangle-free graphs

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

Hamiltonian cycles in regular graphs of moderate degree

Paul Erdös, Arthur M. Hobbs, 1977, J. Comb. Theory, Ser. B.

Extremal graphs for weights

Béla Bollobás, Paul Erdös, Amites Sarkar, 1999, Discret. Math..

Maximal antiramsey graphs and the strong chromatic number

Paul Erdös, Ronald L. Graham, Stefan A. Burr, 1989, J. Graph Theory.

The Giant Component 1960-1993

Paul Erdös, P. Erdös, 1993, Random Struct. Algorithms.

Clique partitions and clique coverings

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

Graphs with unavoidable subgraphs with large degrees

Paul Erdös, Lou Caccetta, K. Vijayan, 1988, J. Graph Theory.

Cutting a graph into two dissimilar halves

Paul Erdös, Joel H. Spencer, János Pach, 1988, J. Graph Theory.

Distributed Loop Network with Minimum Transmission Delay

Paul Erdös, D. Frank Hsu, 1992, Theor. Comput. Sci..

More results on Ramsey—Turán type problems

Endre Szemerédi, Paul Erdös, András Hajnal, 1983, Comb..

Bounds for arrays of dots with distinct slopes or lengths

Paul Erdös, Ronald L. Graham, Herbert Taylor, 1992, Comb..

On finite superuniversal graphs

Paul Erdös, Paul C. Kainen, Stephen H. Hechler, 1978, Discret. Math..

Vertex coverings by monochromatic cycles and trees

Paul Erdös, András Gyárfás, László Pyber, 1991, J. Comb. Theory, Ser. B.

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

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1993, Eur. J. Comb..

Problems for Solution: 4783-4787

Paul Erdös, Murray S. Klamkin, Leonard Carlitz, 1958 .

Monochromatic and zero-sum sets of nondecreasing diameter

Paul Erdös, Hanno Lefmann, Arie Bialostocki, 1995, Discret. Math..

Radius, diameter, and minimum degree

Zsolt Tuza, Paul Erdös, János Pach, 1989, J. Comb. Theory, Ser. B.

How to make a graph bipartite

Paul Erdös, Joel H. Spencer, János Pach, 1987, J. Comb. Theory, Ser. B.

Arithmetic progressions in subset sums

Paul Erdös, András Sárközy, P. Erdös, 1992, Discret. Math..

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

Paul Erdös, Michel Deza, 1975, Discret. Math..

On some applications of graph theory, I

Paul Erdös, Vera T. Sós, Amram Meir, 1972, Discret. Math..

Ramsey Size Linear Graphs

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1993, Combinatorics, Probability and Computing.

On k-saturated graphs with restrictions on the degrees

Noga Alon, Paul Erdös, Ron Holzman, 1996, J. Graph Theory.

Finite linear spaces and projective planes

Paul Erdös, Douglas R. Stinson, Ronald C. Mullin, 1983, Discret. Math..

Addendum to "trees in random graphs"

Paul Erdös, Zbigniew Palka, 1984, Discret. Math..

Ulam, the man and the mathematician

Paul Erdös, 1985, J. Graph Theory.

Induced subgraphs of given sizes

Zoltán Füredi, Paul Erdös, Bruce Rothschild, 1999, Discret. Math..

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

Paul Erdös, 1992, SIAM Rev..

A Class of Edge Critical 4-Chromatic Graphs

Richard H. Schelp, Paul Erdös, András Gyárfás, 1997, Graphs Comb..

Multiplicities of Interpoint Distances in Finite Planar Sets

Peter C. Fishburn, Paul Erdös, 1995, Discret. Appl. Math..

Prime power divisors of binomial coefficients

Paul Erdös, Grigori Kolesnik, 1999, Discret. Math..

A Ramsey problem of Harary on graphs with prescribed size

Richard H. Schelp, Paul Erdös, Cecil C. Rousseau, 1987, Discret. Math..

On the angular distribution of Gaussian integers with fixed norm

Paul Erdös, Richard Roxby Hall, 1999, Discret. Math..

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

Zoltán Füredi, Paul Erdös, Peter Frankl, 1982, J. Comb. Theory, Ser. A.

Extremal problems on permutations under cyclic equivalence

Paul Erdös, Nathan Linial, Shlomo Moran, 1987, Discret. Math..

Problems and results in combinatorial analysis and graph theory

Paul Erdös, P. Erdös, 1988, Discret. Math..

D-complete Sequences of Integers

Paul Erdös, Mordechai Lewin, 1996, Math. Comput..

Tight bounds on the chromatic sum of a connected graph

Paul Erdös, Carsten Thomassen, Yousef Alavi, 1989, J. Graph Theory.

On product representations of powers, I

Paul Erdös, András Sárközy, Vera T. Sós, 1995, Eur. J. Comb..

Ensembles de multiples de suites finies

Paul Erdös, Gerald Tenenbaum, Paul Erdös, 1999, Discret. Math..

On total matching numbers and total covering numbers of complementary graphs

Paul Erdös, Amram Meir, P. Erdös, 1977, Discret. Math..

Graphs of diameter two with no 4-circuits

Paul Erdös, Siemion Fajtlowicz, John Adrian Bondy, 1999, Discret. Math..

On a Combinatorial Game

Paul Erdös, J. L. Selfridge, P. Erdös, 1973, J. Comb. Theory A.

Distinct Distances Determined By Subsets of a Point Set in Space

Paul Erdös, János Pach, David Avis, 1991, Comput. Geom..

Intervertex Distances in Convex Polygons

Peter C. Fishburn, Paul Erdös, 1995, Discret. Appl. Math..

Random induced graphs

Béla Bollobás, Richard H. Schelp, Paul Erdös, 2002, Discret. Math..

PROBLEMS AND RESULTS IN FINITE AND INFINITE COMBINATORIAL ANALYSIS

Paul Erdös, Andras Hajnal, P. Erdös, 1970 .

Problems for Solution: 3739-3743

Paul Erdös, Norman Anning, H. D. Ruderman, 1935 .

On the structure of edge graphs ii

Miklós Simonovits, Béla Bollobás, Paul Erdös, 1976 .

Notes on Sum-Free and Related Sets

Paul Erdös, Peter J. Cameron, 1999 .

Some Linear and Some Quadratic Recursion Formulas. I

Paul Erdös, P. Erdös, Fa Dick de Bruijn, 1951 .

Random walks on Z 2 n

Paul Erdös, Robert W. Chen, P. Erdös, 1988 .

On divisibility properties of integers of the forma+á

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

Note on Normal Decimals

Paul Erdös, Harold Davenport, P. Erdös, 1952, Canadian Journal of Mathematics.

Multiplicative Functions and Small Divisors, II

Paul Erdös, Krishnaswami Alladi, Jeffrey D. Vaaler, 1989 .

Corrections to Two of My Papers

Paul Erdös, P. Erdös, 1943 .

SIZE RAMSEY NUMBERS INVOLVING MATCHINGS

Paul Erdös, Ralph J. Faudree, P. Erdös, 1984 .

Problems and results on diophantine approximations (II)

Paul Erdös, P. Erdös, 1975 .

Conditions for a Zero Sum Modulo n

Paul Erdös, J. D. Bovey, Ivan Niven, 1975, Canadian Mathematical Bulletin.

On the average ratio of the smallest and largest prime divisor of n

Paul Erdös, J. H. van Lint, P. Erdös, 1982 .

On a Problem of Additive Number Theory

Paul Erdös, W. H. J. Fuchs, P. Erdös, 1956 .

A Problem on Tournaments

Paul Erdös, Leo Moser, P. Erdös, 1964, Canadian Mathematical Bulletin.

On Divergence Properties of the Lagrange Interpolation Parabolas

Paul Erdös, 1941 .

SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY

Paul Erdös, P. Erdös, 1993 .

On sequences of integers generated by a sieving process

Paul Erdös, Eri Jabotinsky, 1958 .

Some Problems and Results on Combinatorial Number Theory

Paul Erdös, 1989 .

Highly Composite Numbers

Paul Erdös, P. Erdös, S. Ramanujan, 1915 .

Generalized Ramsey theory for multiple colors

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

The star number of coverings of space with convex bodies

Paul Erdös, C. A. Rogers, 1964 .

On some problems of elementary and combinatorial geometry

Paul Erdös, 1975 .

On the representing number of intersecting families

Paul Erdös, Martin Aigner, P. Erdös, 1987 .

Random-network models of the conductance of disordered condensed matter

Paul Erdös, Stephen B. Haley, 1976 .

COMBINATORIAL PROBLEMS IN GEOMETRY AND NUMBER THEORY

Paul Erdös, 1979 .

On Interpolation II: On the Distribution of the Fundamental Points of Lagrange and Hermite Interpolation

Paul Erdös, Paul Turán, P. Erdös, 1938 .

On an Elementary Proof of Some Asymptotic Formulas in the Theory of Partitions

Paul Erdös, P. Erdös, 1942 .

On partitions of lines and space

Paul Erdös, R. Daniel Mauldin, Steve Jackson, 1994 .

A problem on ordered sets

Paul Erdös, Richard Rado, P. Erdös, 1953 .

The nonexistence of certain invariant measures

Paul Erdös, R. Daniel Maulin, 1976 .

Some remarks on polynomials

Paul Erdös, 1947 .

A problem of Leo Moser about repeated distances on the sphere

Paul Erdös, János Pach, P. Erdös, 1989 .

A New Function Associated with the Prime Factors of \binomnk

Paul Erdös, J. L. Selfridge, E. F. Ecklund, 1974 .

On the number of positive integers $\leq x$ and free of prime factors $>y$

Paul Erdös, J. H. van Lint, 1966 .

Extremal problems for directed graphs

Miklós Simonovits, Paul Erdös, W. G Brown, 1973 .

On some asymptotic formulas in the theory of partitions

Paul Erdös, P. Erdös, 1946 .

On the Distribution of Roots of Polynomials

Paul Erdös, Paul Turán, P. Erdös, 1950 .

INVERSE EXTREMAL DIGRAPH PROBLEMS

Miklós Simonovits, Paul Erdös, W. G Brown, 1984 .

The Construction of Certain Graphs

Paul Erdös, C. A. Rogers, C. Rogers, 1966, Canadian Journal of Mathematics.

Congruent subsets of infinite sets of natural numbers.

Paul Erdös, Egbert Harzheim, 1986 .

Some Old and New Problems in Combinatorial Geometry

Paul Erdös, P. Erdös, 1984 .

On the density of odd integers of the form (p − 1)2−n and related questions

Paul Erdös, Andrew Odlyzko, A. Odlyzko, 1979 .

On Almost Bipartite Large Chromatic Graphs

Endre Szemerédi, Paul Erdös, Andras Hajnal, 1982 .

SELECTIVITY OF HYPERGRAPHS

Paul Erdös, Vojtěch Rödl, Jaroslav Nešetřil, 1984 .

Some problems in graph theory

Paul Erdös, Paul Erdös, 1974 .

Independence of solution sets and minimal asymptotic bases

Paul Erdös, Prasad Tetali, Melvyn B. Nathanson, 1995 .

On an extremal problem in graph theory

Paul Erdös, Leo Moser, P. Erdös, 1970 .

A probabilistic approach to problems of Diophantine approximation

Paul Erdös, Alfréd Rényi, A. Rényi, 1957 .

On a recursion formula and some Tauberian theorems

Paul Erdös, P. Erdös, Fa Dick de Bruijn, 1953 .

The Asymptotic Number of Latin Rectangles

Paul Erdös, Irving Kaplansky, P. Erdös, 1946 .

On a Ramsey-type problem

Noga Alon, Paul Erdös, Michael Molloy, 2000 .

The product of consecutive integers is never a power

Paul Erdös, J. L. Selfridge, P. Erdös, 1975 .

Theories of electrons in one-dimensional disordered systems

Paul Erdös, Roy C. Herndon, P. Erdös, 1982 .

On Sequences of Positive Integers

Paul Erdös, Harold Davenport, 1951 .

On the Normal Behavior of the Iterates Of some Arithmetic Functions

Paul Erdös, Carl Pomerance, P. Erdös, 1990 .

On sets of coprime integers in intervals

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

Topics in the Theory of Numbers

Paul Erdös, P. Erdös, János Surányi, 2003 .

Two combinatorial problems in group theory

Paul Erdös, R. B. Eggleton, P. Erdös, 1972 .

Additive properties of random sequences of positive integers

Paul Erdös, Alfréd Rényi, A. Rényi, 1960 .

ON SOME PROBLEMS IN GRAPH THEORY , COMBINATORIAL ANALYSIS AND COMBINATORIAL NUMBER THEORY

Paul Erdös, 2004 .

Note on Products of Consecutive Integers

Paul Erdös, 1939 .

Developments in Non-Integer Bases

Paul Erdös, Vilmos Komornik, P. Erdös, 1998 .

On linear independence of sequences in a Banach space.

Paul Erdös, P. Erdös, E. Straus, 1953 .

Algorithmic solution of extremal digraph problems

Miklós Simonovits, Paul Erdös, W. G. Brown, 1985 .

On Almost Primes

Paul Erdös, 1950 .

MORE RESULTS ON SUBGRAPHS WITH MANY SHORT CYCLES

Paul Erdös, Vojtvech Rödl, Richard Duke, 1984 .

On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order

Paul Erdös, P. Erdös, E. Straus, 1960, Canadian Journal of Mathematics.

Some Complete Bipartite Graph - Tree Ramsey Numbers

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

On the distribution of the number of prime factors of sums $a+b$

Paul Erdös, András Sárközy, H. Maier, 1987 .

Mirror Anastigmat with Two Concentric Spherical Surfaces

Paul Erdös, P. Erdös, 1959 .

On sequences of positive integers

Paul Erdös, Harold Davenport, 1936 .

Some new problems and results in Graph Theory and other branches of Combinatorial Mathematics

Paul Erdös, 1981 .

On Elements of Sumsets with Many Prime Factors

Paul Erdös, András Sárközy, Carl Pomerance, 1993 .

Extremal problems on graphs and hypergraphs

Paul Erdös, P. Erdös, 1974 .

SOME REMARKS ON SET THEORY IV

Paul Erdös, P. Erdös, 2004 .

Lagrange’s theorem with ^{1/3} squares

Paul Erdös, Melvyn B. Nathanson, S. L G Choi, 1980 .

Upper bounds on linear vertex-arboricity of complementary graphs

Paul Erdös, Yousef Alavi, Peter Che Bor Lam, 1997 .

On the Fundamental Problem of Mathematics

Paul Erdös, P. Erdös, 1972 .

Separability properties of almost — disjoint families of sets

Saharon Shelah, Paul Erdös, S. Shelah, 1972 .

On the addition of residue classes mod p

Paul Erdös, P. Erdös, H. Heilbronn, 1964 .

Some of my Favourite Problems in Number Theory, Combinatorics, and Geometry

Paul Erdös, P. Erdös, 1995 .

On the Enumeration of Finite Groups

Paul Erdös, V. Kumar Murty, M. Ram Murty, 1987 .

INTERSECTION PROPERTIES OF SYSTEMS OF FINITE SETS

Paul Erdös, Peter Frankl, Michel Deza, 1978 .

Some remarks on number theory

Paul Erdös, 1965 .

On Interpolation. III. Interpolatory Theory of Polynomials

Paul Erdös, Paul Turán, P. Erdös, 1940 .

On problems of Moser and Hanson

Saharon Shelah, Paul Erdös, S. Shelah, 1972 .

Intersection theorems for systems of sets (III)

Paul Erdös, Richard Rado, E. C. Milner, 1974, Journal of the Australian Mathematical Society.

A problem in covering progressions

Paul Erdös, Joel Spencer, 1994 .

On a theorem of Behrend

Endre Szemerédi, Paul Erdös, András Sárközy, 1967, Journal of the Australian Mathematical Society.

On an Elementary Problem in Number Theory

Paul Erdös, P. Erdös, 1958, Canadian Mathematical Bulletin.

Some problems in partitio numerorum

Paul Erdös, P. Erdös, J. Loxton, 1979, Journal of the Australian Mathematical Society.

On Primitive Abundant Numbers

Paul Erdös, P. Erdös, 1935 .

An intersection property of sets with positive measure

Paul Erdös, H. Kestelman, C. A. Rogers, 1963 .

SOME PROBLEMS ON NUMBER THEORY

Paul Erdös, P. Erdös, 1969 .

On a Theorem of Hsu and Robbins

Paul Erdös, P. Erdös, 1949 .

A Theorem of Sylvester and Schur

Paul Erdös, P. Erdös, 1934 .

On Differences and sums of Integers, II

Paul Erdös, András Sárközy, P. Erdös, 1977 .

Distinct distances between lattice points

Paul Erdös, Richard K. Guy, P. Erdös, 1970 .

On highly composite and similar numbers

Paul Erdös, P. Erdös, L. Alaoglu, 1944 .

Generalized Ramsey Numbers Involving Subdivision Graphs, And Related Problems in Graph Theory*

Paul Erdös, Stefan A. Burr, P. Erdös, 1980 .

How to Define an Irregular Graph

Paul Erdös, Gary Chartrand, Ortrud R. Oellermann, 1988 .

A colour problem for infinite graphs and a problem in the theory of relations

Paul Erdös, de Ng Dick Bruijn, P. Erdös, 1951 .

On a Problem in Graph Theory

Paul Erdös, Andras Hajnal, J. Moon, 1963, The Mathematical Gazette.

A Ramsey-type theorem for bipartite graphs

Paul Erdös, János Pach, Andras Hajnal, 2000 .

Convex nonagons with five intervertex distances

Peter C. Fishburn, Paul Erdös, 1996 .

A theorem on partial well-ordering of sets of vectors

Paul Erdös, Richard Rado, P. Erdös, 1959 .

An Extremal Problem of Graphs with Diameter 2

Béla Bollobás, Paul Erdös, 1975 .

A Selection of Problems and Results in Combinatorics

Paul Erdös, P. Erdös, 1999, Combinatorics, Probability and Computing.

On a Diophantine Equation

Paul Erdös, 1951 .

Some asymptotic formulas on generalized divisor functions, II

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

On the probability that n. and g(n) are relatively prime

Paul Erdös, George G. Lorentz, 1959 .

Some remarks about additive and multiplicative functions

Paul Erdös, P. Erdös, 1946 .

On a classification of denumerable order types and an application to the partition calculus

Paul Erdös, Andras Hajnal, P. Erdös, 1962 .

On the Lipschitz's condition for Brownian motion

Paul Erdös, Kai Lai Chung, K. Chung, 1959 .

Problems for Solution: 3758-3763

Paul Erdös, Victor Thebault, W. P. Udinski, 1935 .

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

Paul Erdös, Vance Faber, Jean Larson, 1981 .

On a class of aperiodic sum-free sets

Paul Erdös, Neil J. Calkin, 1996 .

On the Number of Real Roots of a Random Algebraic Equation

Paul Erdös, A. C. Offord, 1956 .

Monotonicity of partition functions

Paul Erdös, Paul T. Bateman, P. Erdös, 1956 .

Some remark on Euler's φ function

Paul Erdös, 1958 .

An inequality for the maximum of trigonometric polynomials

Paul Erdös, P. Erdös, 1962 .

Multipartite Graph‐Tree Ramsey Numbers

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

On the Difference between Consecutive Ramsey Numbers

Paul Erdös, Ralph J. Faudree, P. Erdös, 1989 .

Bandwidth versus Bandsize

Peter Winkler, Paul Erdös, Pavol Hell, 1988 .

Problems and results on the theory of interpolation. II

Paul Erdös, P. Erdös, 1958 .

Alternating Hamiltonian cycles

Béla Bollobás, Paul Erdös, B. Bollobás, 1976 .

Isomorphic subgraphs in a graph

Paul Erdös, János Pach, L. Pyber, 1988 .

A Survey of Problems in Combinatorial Number Theory

Paul Erdös, 1980 .

On a theorem of Rademacher-Turán

Paul Erdös, P. Erdös, 1962 .

Partition Relations and Transitivity Domains of Binary Relations

Paul Erdös, Richard Rado, P. Erdös, 1967 .

Matching the natural numbers up to n with distinct multiples in another interval

Paul Erdös, Carl Pomerance, 1980 .

Remarks on stars and independent sets

Paul Erdös, János Pach, 1984 .

Ramsey-minimal graphs for multiple copies

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

On Some Aspects of my Work with Gabriel Dirac

Paul Erdös, P. Erdös, 1988 .

The Ramsey number for the pair complete bipartite graph-graph of limited degree

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

The covering of n-dimensional space by spheres

Paul Erdös, C. A. Rogers, 1953 .

ON MAXIMUM CHORDAL SUBGRAPH

Paul Erdös, Renu C. Laskar, P. Erdös, 1983 .

On some problems involving inaccessible cardinals

Paul Erdös, Alfred Tarski, A. Tarski, 1961 .

A conjecture in elementary number theory

Paul Erdös, L. Alaoglu, 1944 .

On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph

Paul Erdös, A. Barak, P. Erdös, 1984 .

On Orthogonal Polynomials with Regularly Distributed Zeros

Paul Erdös, Géza Freud, P. Erdös, 1974 .

Some additive properties of sets of real numbers

Paul Erdös, Kenneth Kunen, R. Daniel Mauldin, 1981 .

A new function associated with the prime factors of (ⁿ_

Paul Erdös, J. L. Selfridge, E. F. Ecklund, 1974 .

A property of power series with positive coefficients

Paul Erdös, H. Pollard, William Feller, 1949 .

On multiplicative representations of integers

Paul Erdös, A. Szemerédi, Jennifer Seberry Wallis, 1976, Journal of the Australian Mathematical Society.

On Some Sequences of Integers

Paul Erdös, Paul Turán, P. Erdös, 1936 .

Euclidean Ramsey theorems III: Infinite and finite sets

Paul Erdös, Joel Spencer, 1973 .

On the multiplicative representation of integers

Paul Erdös, P. Erdös, 1964 .

Small transversals in uniform hypergraphs

Alexandr V. Kostochka, Paul Erdös, Zs. Tuza, 1992 .

Bounds on threshold dimension and disjoint threshold coverings

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

Lagrange's Theorem and Thin Subsequences of Squares

Paul Erdös, Melvyn B. Nathanson, 1981 .

On Nilpotent but Not Abelian Groups and Abelian but Not Cyclic Groups

Paul Erdös, Michael E. Mays, 1988 .

Standard-Basis Operator Method in the Green's-Function Technique of Many-Body Systems with an Application to Ferromagnetism

Paul Erdös, P. Erdös, S. Haley, 1972 .

Some Problems on Random Walk in Space

Paul Erdös, A Dvoretzky, A. Dvoretzky, 1951 .

On some of my favourite problems in graph theory and block designs

Paul Erdös, P. Erdös, 1991 .

On the normal number of prime factors of p-1 and some related problems concerning euler's o/-function

Paul Erdös, P. Erdös, 1935 .

Bases for sets of integers

Paul Erdös, Donald J. Newman, 1977 .

Some remarks on the measurability of certain sets

Paul Erdös, P. Erdös, 1945 .

The Solution to a Problem of Grünbaum

Paul Erdös, Peter Salamon, P. Erdös, 1988, Canadian Mathematical Bulletin.