Problems
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
618 of 1,221 problems match
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
Asks whether every entire function of finite order with has , where and are its minimum and maximum modulus on .
Asks whether complex numbers with always satisfy for an absolute constant .
Asks whether, for a Rademacher random multiplicative function , the limit superior of is almost surely a positive constant. A Lean proof built and audited here shows the ratio tends to 0, so the answer is no.
Asks whether the number of real roots of a random degree- polynomial with independent uniform coefficients satisfies almost surely.
Asks whether some makes the maximum on of a random degree- polynomial with independent uniform coefficients equal almost surely.
Asks whether all but of the degree- polynomials with coefficients have somewhere on , and how behaves.
Asks for a necessary and sufficient condition on arc lengths with under which independent random arcs of these lengths cover the unit circle with probability .
Asks whether, for real with and , almost every choice of signs makes converge at some on the unit circle.
Asks whether every two-coloring of has an infinite set whose finite non-empty subset sums all have one color. The answer is yes, by Hindman's theorem, proved in Hindman's 1974 paper and in Baumgartner's 1974 note.
Asks whether, for fixed and large , every -free graph on vertices with at least edges has a set of vertices spanning no triangle.
Asks for the largest that contains and has for all distinct .
Asks whether, for each and all large , every with contains with for some distinct primes .
Asks whether every with has a non-empty subset summing to modulo ; proved by Szemerédi in 1970 for all finite abelian groups.
Asks whether residues modulo whose non-empty zero-sum subsets all have the same size must take at most two distinct values. This is Graham's conjecture, proved for large primes in 1976 and for every modulus in 2010.
Asks whether a set with all pairwise least common multiples above has , and whether a positive proportion of the integers up to are divisible by no element of . Schinzel and Szekeres answered yes and no.
Asks whether , where is the least such that a random -subset of an abelian group of order has subset sums covering the group with probability at least .
Asks whether for every graph with edges and no isolated vertices.
Asks whether every tree on vertices has ; proved in 2026, on the evidence of a third party's Lean proof that was built here. The erdosproblems.com wording also covers the one-vertex tree, where it fails.
Asks whether every graph on vertices with at least edges contains every tree on vertices. The Erdős–Sós tree edge bound is proved, and the page records the precise relation between its sharp threshold and the erdosproblems.com statement.
Asks whether every tree with vertices in one class and in the other has .
Asks for a proof that , where is the three-color Ramsey number for two triangles and and is the two-color one.
Asks whether for every tree on vertices, where is the -color Ramsey number.
Asks whether every graph on vertices with maximum degree has size Ramsey number . It is false already for maximum degree .
Asks whether for every graph on vertices, where the induced Ramsey number is the fewest vertices of a graph in which every two-coloring of the edges gives an induced monochromatic copy of .