 |
|
|
|
There are 15 different meanings of Erdős conjecture.
Erdős conjecture Disambiguation

Diophantine equation
2 products, approx. 7 pages
The Erdős–Stewart conjecture on the Diophantine equation n! + 1 = pka pk+1b (solved by Luca)
Sylvester's sequence
1 product, approx. 7 pages
A conjecture on quickly growing integer sequences with rational reciprocal series.
Powerful number
1 product, approx. 5 pages
The Erdős–Mollin–Walsh conjecture on consecutive triples of powerful numbers.
Erdős–Szekeres conjecture
1 product, approx. 5 pages
The Erdős–Szekeres conjecture on the number of points needed to ensure that a point set contains a large convex polygon.
Erdős–Straus conjecture
1 product, approx. 4 pages
The Erdős–Straus conjecture on the Diophantine equation 4/n = 1/x + 1/y + 1/z.
Restricted sumset
1 product, approx. 2 pages
The Erdős–Heilbronn conjecture in combinatorial number theory on the number of sums of two sets of residues modulo a prime.
Erdős–Graham conjecture
1 product, approx. 1 pages
The Erdős–Graham conjecture in combinatorial number theory on monochromatic Egyptian fraction representations of unity.
Erdős–Woods number
1 product, approx. 1 pages
The Erdős–Woods conjecture on numbers determined by the set of prime divisors of the following k numbers.
Erdős–Gyárfás conjecture
1 product, approx. 1 pages
The Erdős–Gyárfás conjecture on cycles with lengths equal to a power of two in graphs with minimum degree 3.
Erdős–Mordell inequality
1 product, approx. 1 pages
The Erdős–Mordell inequality on distances of pedal points in triangles (MathWorld)
Cameron–Erdős conjecture
1 product, approx. 0 pages
The Cameron–Erdős conjecture on sum-free sets of integers, solved by Green.
The prolific mathematician Paul Erdős and his various collaborators made many famous mathematical conjectures, over a wide field of subjects. Some of these are the following:

|
|


|
|  |
 |
|  |