Paul Erdős

According to our database1, Paul Erdős
  • authored at least 220 papers between 1959 and 2013.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
Some of My Favorite Problems and Results.
Proceedings of the Mathematics of Paul Erdős I, 2013

Dense Difference Sets and Their Combinatorial Structure.
Proceedings of the Mathematics of Paul Erdős I, 2013

2006
On some applications of graph theory, I.
Discrete Mathematics, 2006

Extremal problems among subsets of a set.
Discrete Mathematics, 2006

2003
On large intersecting subfamilies of uniform setfamilies.
Random Struct. Algorithms, 2003

On the equality of the partial Grundy and upper ochromatic numbers of graphs.
Discrete Mathematics, 2003

2002
A Ramsey-type problem and the Turán numbers.
Journal of Graph Theory, 2002

Random induced graphs.
Discrete Mathematics, 2002

2001
Edge disjoint monochromatic triangles in 2-colored graphs.
Discrete Mathematics, 2001

1999
Finding Large p-Colored Diameter Two Subgraphs.
Graphs and Combinatorics, 1999

Ensembles de multiples de suites finies.
Discrete Mathematics, 1999

On the orders of directly indecomposable groups.
Discrete Mathematics, 1999

Subsets of an interval whose product is a power.
Discrete Mathematics, 1999

On arithmetic properties of integers with missing digits II: Prime factors.
Discrete Mathematics, 1999

Greedy algorithm, arithmetic progressions, subset sums and divisibility.
Discrete Mathematics, 1999

Prime power divisors of binomial coefficients.
Discrete Mathematics, 1999

Popular distances in 3-space.
Discrete Mathematics, 1999

On the angular distribution of Gaussian integers with fixed norm.
Discrete Mathematics, 1999

Split and balanced colorings of complete graphs.
Discrete Mathematics, 1999

Induced subgraphs of given sizes.
Discrete Mathematics, 1999

The number of cycle lengths in graphs of given minimum degree and girth.
Discrete Mathematics, 1999

On a question about sum-free sequences.
Discrete Mathematics, 1999

Sur les ensembles représentés par les partitions d'un entier n1.
Discrete Mathematics, 1999

Graphs of diameter two with no 4-circuits.
Discrete Mathematics, 1999

Extremal graphs for weights.
Discrete Mathematics, 1999

1998
How to decrease the diameter of triangle-free graphs.
Combinatorica, 1998

Graphs of Extremal Weights.
Ars Comb., 1998

1997
New Ramsey Bounds from Cyclic Graphs of Prime Order.
SIAM J. Discrete Math., 1997

Intersection Statements for Systems of Sets.
J. Comb. Theory, Ser. A, 1997

A Class of Edge Critical 4-Chromatic Graphs.
Graphs and Combinatorics, 1997

Covering a graph by complete bipartite graphs.
Discrete Mathematics, 1997

The size of the largest bipartite subgraphs.
Discrete Mathematics, 1997

Distinct distances in finite planar sets.
Discrete Mathematics, 1997

Some old and new problems in various branches of combinatorics.
Discrete Mathematics, 1997

Some recent problems and results in graph theory.
Discrete Mathematics, 1997

Minimum Planar Sets with Maximum Equidistance Counts.
Comput. Geom., 1997

On cycles in the coprime graph of integers.
Electr. J. Comb., 1997

A Variant of the Classical Ramsey Problem.
Combinatorica, 1997

1996
d-complete sequences of integers.
Math. Comput., 1996

Hypercube subgraphs with minimal detours.
Journal of Graph Theory, 1996

On k-saturated graphs with restrictions on the degrees.
Journal of Graph Theory, 1996

Proof of a Conjecture of Bollob's on Nested Cycles.
J. Comb. Theory, Ser. B, 1996

Ramsey-remainder.
Eur. J. Comb., 1996

Sizes of graphs with induced subgraphs of large maximum degree.
Discrete Mathematics, 1996

Covering and independence in triangle structures.
Discrete Mathematics, 1996

Graphs in which each C4 spans K4.
Discrete Mathematics, 1996

Maximum planar sets that determine k distances.
Discrete Mathematics, 1996

1995
On the Size of a Random Maximal Graph.
Random Struct. Algorithms, 1995

Covering of r-Graphs by Complete r-Partite Subgraphs.
Random Struct. Algorithms, 1995

Extremal Graphs for Intersecting Triangles.
J. Comb. Theory, Ser. B, 1995

On product representations of powers, I.
Eur. J. Comb., 1995

Degree sequence and independence in K(4)-free graphs.
Discrete Mathematics, 1995

Monochromatic and zero-sum sets of nondecreasing diameter.
Discrete Mathematics, 1995

Two Combinatorial Problems in the Plane.
Discrete & Computational Geometry, 1995

Intervertex Distances in Convex Polygons.
Discrete Applied Mathematics, 1995

Multiplicities of Interpoint Distances in Finite Planar Sets.
Discrete Applied Mathematics, 1995

1994
Change of Leadership in a Random Graph Process.
Random Struct. Algorithms, 1994

Local and global average degree in graphs and multigraphs.
Journal of Graph Theory, 1994

On additive properties of general sequences.
Discrete Mathematics, 1994

A local density condition for triangles.
Discrete Mathematics, 1994

Extremal problems and generalized degrees.
Discrete Mathematics, 1994

Problems and results in discrete mathematics.
Discrete Mathematics, 1994

A Postscript on Distances in Convex n-Gons.
Discrete & Computational Geometry, 1994

Turán-Ramsey Theorems and Kp-Independence Numbers.
Combinatorics, Probability & Computing, 1994

Independet Transversals in Sparse Partite Hypergraphs.
Combinatorics, Probability & Computing, 1994

Crossing Families.
Combinatorica, 1994

1993
The Giant Component 1960-1993.
Random Struct. Algorithms, 1993

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs.
Eur. J. Comb., 1993

The size Ramsey number of a complete bipartite graph.
Discrete Mathematics, 1993

Monochromatic infinite paths.
Discrete Mathematics, 1993

The grid revisted.
Discrete Mathematics, 1993

Clique Partitions of Chordal Graphs.
Combinatorics, Probability & Computing, 1993

Nearly Equal Distances in the Plane.
Combinatorics, Probability & Computing, 1993

Ramsey Size Linear Graphs.
Combinatorics, Probability & Computing, 1993

On graphical partitions.
Combinatorica, 1993

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

Clique coverings of the edges of a random graph.
Combinatorica, 1993

1992
Distributed Loop Network with Minimum Transmission Delay.
Theor. Comput. Sci., 1992

Optimum Multiple Access Coding (D.B. Jevtić).
SIAM Review, 1992

An Extremal Problem.
SIAM Review, 1992

Diverse Homogeneous Sets.
J. Comb. Theory, Ser. A, 1992

Arithmetic progressions in subset sums.
Discrete Mathematics, 1992

Covering the cliques of a graph with vertices.
Discrete Mathematics, 1992

Extremal problems involving vertices and edges on odd cycles.
Discrete Mathematics, 1992

Cycle-connected graphs.
Discrete Mathematics, 1992

Bounds for arrays of dots with distinct slopes or lengths.
Combinatorica, 1992

In memory of Tibor Gallai.
Combinatorica, 1992

1991
Midpoints of Diagonals of Convex n-GONS.
SIAM J. Discrete Math., 1991

The Dimension of Random Ordered Sets.
Random Struct. Algorithms, 1991

Some extremal results in cochromatic and dichromatic theory.
Journal of Graph Theory, 1991

Local constraints ensuring small representing sets.
J. Comb. Theory, Ser. A, 1991

Vertex coverings by monochromatic cycles and trees.
J. Comb. Theory, Ser. B, 1991

Matchings from a set below to a set above.
Discrete Mathematics, 1991

Some Ramsey-type theorems.
Discrete Mathematics, 1991

Saturated r-uniform hypergraphs.
Discrete Mathematics, 1991

Degree sequences in triangle-free graphs.
Discrete Mathematics, 1991

Lopsided Lovász Local Lemma and Latin transversals.
Discrete Applied Mathematics, 1991

Distinct Distances Determined By Subsets of a Point Set in Space.
Comput. Geom., 1991

Crossing Families.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Representations of Integers as the Sum of k Terms.
Random Struct. Algorithms, 1990

Quasi-progressions and descending waves.
J. Comb. Theory, Ser. A, 1990

Colouring prime distance graphs.
Graphs and Combinatorics, 1990

Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number.
Eur. J. Comb., 1990

Subgraphs of minimal degree k.
Discrete Mathematics, 1990

Countable Decompositions of R2 and R3.
Discrete & Computational Geometry, 1990

Variation on the theme of repeated distances.
Combinatorica, 1990

Gaps in Difference Sets, and the Graph of Nearly Equal Distances.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
Tight bounds on the chromatic sum of a connected graph.
Journal of Graph Theory, 1989

Domination in colored complete graphs.
Journal of Graph Theory, 1989

Representations of graphs and orthogonal latin square graphs.
Journal of Graph Theory, 1989

Maximal antiramsey graphs and the strong chromatic number.
Journal of Graph Theory, 1989

Monochromatic sumsets.
J. Comb. Theory, Ser. A, 1989

Radius, diameter, and minimum degree.
J. Comb. Theory, Ser. B, 1989

On the number of partitions of n without a given subsum (I).
Discrete Mathematics, 1989

On the number of distinct induced subgraphs of a graph.
Discrete Mathematics, 1989

On the Graph of Large Distance.
Discrete & Computational Geometry, 1989

Disjoint Edges in Geometric Graphs.
Discrete & Computational Geometry, 1989

Ramsey-type theorems.
Discrete Applied Mathematics, 1989

The size of chordal, interval and threshold subgraphs.
Combinatorica, 1989

1988
Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays.
Mathematical Systems Theory, 1988

Cutting a graph into two dissimilar halves.
Journal of Graph Theory, 1988

A tribute to Torrence Parsons.
Journal of Graph Theory, 1988

Graphs with unavoidable subgraphs with large degrees.
Journal of Graph Theory, 1988

How to make a graph bipartite.
J. Comb. Theory, Ser. B, 1988

Repeated distances in space.
Graphs and Combinatorics, 1988

Intersection Graphs for Families of Balls in Rn.
Eur. J. Comb., 1988

Extremal theory and bipartite graph-tree Ramsey numbers.
Discrete Mathematics, 1988

Clique partitions and clique coverings.
Discrete Mathematics, 1988

Problems and results in combinatorial analysis and graph theory.
Discrete Mathematics, 1988

Optima of dual integer linear programs.
Combinatorica, 1988

On Admissible Constellations of Consecutive Primes.
BIT, 1988

1987
On the equality of the grundy and ochromatic numbers of a graph.
Journal of Graph Theory, 1987

On unavoidable hypergraphs.
Journal of Graph Theory, 1987

Highly irregular graphs.
Journal of Graph Theory, 1987

Goodness of trees for generalized books.
Graphs and Combinatorics, 1987

k-Connectivity in Random Graphs.
Eur. J. Comb., 1987

Extremal problems on permutations under cyclic equivalence.
Discrete Mathematics, 1987

A Ramsey problem of Harary on graphs with prescribed size.
Discrete Mathematics, 1987

1986
Maximum induced trees in graphs.
J. Comb. Theory, Ser. B, 1986

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

Two problems in extremal graph theory.
Graphs and Combinatorics, 1986

Coloring graphs with locally few colors.
Discrete Mathematics, 1986

Clique numbers of graphs.
Discrete Mathematics, 1986

On some metric and combinatorial geometric problems.
Discrete Mathematics, 1986

Extremal clique coverings of complementary graphs.
Combinatorica, 1986

1985
Ulam, the man and the mathematician.
Journal of Graph Theory, 1985

On 2-Designs.
J. Comb. Theory, Ser. A, 1985

Colouring the real line.
J. Comb. Theory, Ser. B, 1985

Extremal subgraphs for two graphs.
J. Comb. Theory, Ser. B, 1985

Quantitative Forms of a Theorem of Hilbert.
J. Comb. Theory, Ser. A, 1985

Notes of welcome.
Graphs and Combinatorics, 1985

An Application of Graph Theory to Additive Number Theory.
Eur. J. Comb., 1985

A note on the interval number of a graph.
Discrete Mathematics, 1985

Chromatic number of finite and infinite graphs and hypergraphs.
Discrete Mathematics, 1985

Multipartite graph - space graph Ramsey numbers.
Combinatorica, 1985

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

Dual Integer Linear Programs and the Relationship between their Optima
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Bounds on threshold dimension and disjoint threshold coverings (abstract only).
Proceedings of the 13th ACM Annual Conference on Computer Science, 1985

1984
Addendum to "trees in random graphs".
Discrete Mathematics, 1984

Enumeration of intersecting families.
Discrete Mathematics, 1984

1983
Local connectivity of a random graph.
Journal of Graph Theory, 1983

On a Quasi-Ramsey problem.
Journal of Graph Theory, 1983

Generalizations of a Ramsey-theoretic result of chvátal.
Journal of Graph Theory, 1983

Trees in random graphs.
Discrete Mathematics, 1983

Finite linear spaces and projective planes.
Discrete Mathematics, 1983

Supersaturated graphs and hypergraphs.
Combinatorica, 1983

More results on Ramsey - Turán Type problems.
Combinatorica, 1983

On unavoidable graphs.
Combinatorica, 1983

1982
Graphs with certain families of spanning trees.
J. Comb. Theory, Ser. B, 1982

Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.
J. Comb. Theory, Ser. A, 1982

Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs.
J. Comb. Theory, Ser. A, 1982

On a problem in combinatorial geometry.
Discrete Mathematics, 1982

Disjoint cliques and disjoint maximal independent sets of vertices in graphs.
Discrete Mathematics, 1982

Ramsey-minimal graphs for forests.
Discrete Mathematics, 1982

On Ramsey - Turán type theorems for hypergraphs.
Combinatorica, 1982

Compactness results in extremal graph theory.
Combinatorica, 1982

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

1981
Some Bounds for the Ramsey-Paris-Harrington Numbers.
J. Comb. Theory, Ser. A, 1981

Ramsey-minimal graphs for star-forests.
Discrete Mathematics, 1981

On the conjecture of Hajós.
Combinatorica, 1981

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

Minimal decompositions of graphs into mutually isomorphic subgraphs.
Combinatorica, 1981

On Turáns theorem for sparse graphs.
Combinatorica, 1981

Sets of natural numbers of positive density and cylindric set algebras of dimension 2
Algebra Universalis, 1981

1980
Random Graph Isomorphism.
SIAM J. Comput., 1980

Maximum degree in graphs of diameter 2.
Networks, 1980

Some Applications of Ramsey's Theorem to Additive Number Theory.
Eur. J. Comb., 1980

Hadwiger's Conjecture is True for Almost Every Graph.
Eur. J. Comb., 1980

On a problem of L. Fejes Tóth.
Discrete Mathematics, 1980

1978
When the cartesian product of directed cycles is Hamiltonian.
Journal of Graph Theory, 1978

A class of Hamiltonian regular graphs.
Journal of Graph Theory, 1978

On cycle - Complete graph ramsey numbers.
Journal of Graph Theory, 1978

Combinatorial Properties of Systems of Sets.
J. Comb. Theory, Ser. A, 1978

Some Combinatorial Problems in the Plane.
J. Comb. Theory, Ser. A, 1978

On finite superuniversal graphs.
Discrete Mathematics, 1978

On additive partitions of integers.
Discrete Mathematics, 1978

1977
Paul Turán, 1910-1976: His work in graph theory.
Journal of Graph Theory, 1977

A note of welcome.
Journal of Graph Theory, 1977

On the chromatic index of almost all graphs.
J. Comb. Theory, Ser. B, 1977

Hamiltonian cycles in regular graphs of moderate degree.
J. Comb. Theory, Ser. B, 1977

On a problem in extremal graph theory.
J. Comb. Theory, Ser. B, 1977

On total matching numbers and total covering numbers of complementary graphs.
Discrete Mathematics, 1977

1976
Partition Theorems for Subsets of Vector Spaces.
J. Comb. Theory, Ser. A, 1976

On a Ramsey-Turán type problem.
J. Comb. Theory, Ser. B, 1976

1975
On Packing Squares with Equal Squares.
J. Comb. Theory, Ser. A, 1975

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

On complete subgraphs of r-chromatic graphs.
Discrete Mathematics, 1975

1974
Remark on a Theorem of Lindström.
J. Comb. Theory, Ser. A, 1974

Extremal problems among subsets of a set.
Discrete Mathematics, 1974

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

1973
On a Combinatorial Game.
J. Comb. Theory, Ser. A, 1973

Euclidean Ramsey Theorems I.
J. Comb. Theory, Ser. A, 1973

On a valence problem in extremal graph theory.
Discrete Mathematics, 1973

On a generalization of Ramsey numbers.
Discrete Mathematics, 1973

1972
On some applications of graph theory, I.
Discrete Mathematics, 1972

Ramsey's theorem and self-complementary graphs.
Discrete Mathematics, 1972

A note on Hamiltonian circuits.
Discrete Mathematics, 1972

1971
Imbalances in k-colorations.
Networks, 1971

On some extremal problems on r-graphs.
Discrete Mathematics, 1971

1959
Elementary Divisors of Normal Matrices.
IBM Journal of Research and Development, 1959


  Loading...