List of conjectures by Paul Erdős

Template:Short description The prolific mathematician Paul Erdős and his various collaborators made many famous mathematical conjectures, over a wide field of subjects, and in many cases Erdős offered monetary rewards for solving them.

Unsolved

• The Erdős–Gyárfás conjecture on cycles with lengths equal to a power of two in graphs with minimum degree 3.
• The Erdős–Hajnal conjecture that in a family of graphs defined by an excluded induced subgraph, every graph has either a large clique or a large independent set.<ref>Template:Citation.</ref>
• The Erdős–Mollin–Walsh conjecture on consecutive triples of powerful numbers.
• The Erdős–Selfridge conjecture that a covering system with distinct moduli contains at least one even modulus.
• The Erdős–Straus conjecture on the Diophantine equation 4/n = 1/x + 1/y + 1/z.
• The Erdős conjecture on arithmetic progressions in sequences with divergent sums of reciprocals.
• The Erdős–Szekeres conjecture on the number of points needed to ensure that a point set contains a large convex polygon.
• The Erdős–Turán conjecture on additive bases of natural numbers.
• A conjecture on quickly growing integer sequences with rational reciprocal series.
• A conjecture with Norman Oler<ref>Template:Citation.</ref> on circle packing in an equilateral triangle with a number of circles one less than a triangular number.
• The minimum overlap problem to estimate the limit of M(n).
• A conjecture that the ternary expansion of <math>2^n</math> contains at least one digit 2 for every <math>n > 8</math>.<ref>Template:Citation</ref>
• The conjecture that the Erdős–Moser equation, Template:Math, has no solutions except Template:Math.

Solved

• The Erdős–Faber–Lovász conjecture on coloring unions of cliques, proved (for all large n) by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus.<ref>Template:Citation</ref>
• The Erdős sumset conjecture on sets, proven by Joel Moreira, Florian Karl Richter, Donald Robertson in 2018. The proof has appeared in "Annals of Mathematics" in March 2019.<ref>Template:Citation.</ref>
• The Burr–Erdős conjecture on Ramsey numbers of graphs, proved by Choongbum Lee in 2015.<ref>Template:Citation</ref><ref>Template:Citation</ref>
• A conjecture on equitable colorings proven in 1970 by András Hajnal and Endre Szemerédi and now known as the Hajnal–Szemerédi theorem.<ref>Template:Citation.</ref>
• A conjecture that would have strengthened the Furstenberg–Sárközy theorem to state that the number of elements in a square-difference-free set of positive integers could only exceed the square root of its largest value by a polylogarithmic factor, disproved by András Sárközy in 1978.<ref>Template:Citation.</ref>
• The Erdős–Lovász conjecture on weak/strong delta-systems, proved by Michel Deza in 1974.<ref>Template:Citation.</ref>
• The Erdős–Heilbronn conjecture in combinatorial number theory on the number of sums of two sets of residues modulo a prime, proved by Dias da Silva and Hamidoune in 1994.<ref>Template:Citation.</ref>
• The Erdős–Graham conjecture in combinatorial number theory on monochromatic Egyptian fraction representations of unity, proved by Ernie Croot in 2000.<ref>Template:Citation. Template:Citation.</ref>
• The Erdős–Stewart conjecture on the Diophantine equation n! + 1 = p_k^a p_k+1^b, solved by Florian Luca in 2001.<ref>Template:Citation.</ref>
• The Cameron–Erdős conjecture on sum-free sets of integers, proved by Ben Green and Alexander Sapozhenko in 2003–2004.<ref>Template:Citation. Template:Citation.</ref>
• The Erdős–Menger conjecture on disjoint paths in infinite graphs, proved by Ron Aharoni and Eli Berger in 2009.<ref>Template:Citation.</ref>
• The Erdős distinct distances problem. The correct exponent was proved in 2010 by Larry Guth and Nets Katz, but the correct power of log n is still undetermined.<ref>Template:Citation.</ref>
• The Erdős–Rankin conjecture on prime gaps, proved by Ford, Green, Konyagin, and Tao in 2014.<ref>Template:Citation</ref>
• The Erdős discrepancy problem on partial sums of ±1-sequences. Terence Tao announced a solution in September 2015; it was published in 2016.<ref>Template:Cite journal</ref>
• The Erdős squarefree conjecture that central binomial coefficients C(2n, n) are never squarefree for n > 4 was proved in 1996.<ref>Template:Citation</ref><ref>Template:Citation</ref>
• The Erdős primitive set conjecture that the sum <math>\sum_{n\in A}\frac{1}{n\log n}</math> for any primitive set A (a set where no member of the set divides another member) attains its maximum at the set of primes numbers, proved by Jared Duker Lichtman in 2022.<ref>Template:Cite journal</ref><ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

• The Erdős-Sauer problem about maximum number of edges an n-vertex graph can have without containing a k-regular subgraph, solved by Oliver Janzer and Benny Sudakov<ref>Template:Cite arXiv</ref><ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

See also

• List of things named after Paul Erdős

External links

• Fan Chung, "Open problems of Paul Erdős in graph theory"
• Fan Chung, living version of "Open problems of Paul Erdős in graph theory"
• {{#invoke:citation/CS1|citation

|CitationClass=web }}