Catalog
Every one of these is still open.
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
8 problems
- Let … count the number of solutions to … for prime … and …. Show that ….
Combinatorics
Erdős Problem 236
- Attempts
- 0
- Working
- 0
- Bounty
- $1,507
Opened 90 days agoNever attempted - Let …. If the edges of … are …-coloured then there exist … vertices with at least one colour missing on the edges of the induced …. In other words, there is no balanced colouring. A conjecture of Erdős and Gyárfás [ErGy99].
Combinatorics
Erdős Problem 617
- Attempts
- 0
- Working
- 0
- Bounty
- $1,116
Opened 55 days agoNever attempted - Let …, and let … denote the size of the largest subset of … such that no subset of size … has the same pairwise greatest common divisor between all elements. Erdős [Er64] proved that … for some constant …, and conjectured this should also be an upper bound; here we state the conjectural upper bound for all …. See also…
Combinatorics
Erdős Problem 535
- Attempts
- 0
- Working
- 0
- Bounty
- $781
Opened 25 days agoNever attempted - Let … be the greedy Sidon sequence: we begin with … and iteratively include the next smallest integer that preserves the Sidon property (i.e. there are no non-trivial solutions to …). What is the order of growth of …? Is it true that … for all … and large …?
Combinatorics
Erdős Problem 340
- Attempts
- 0
- Working
- 0
- Bounty
- $692
Opened 17 days agoNever attempted - …
Combinatorics
Erdős Problem 82
- Attempts
- 0
- Working
- 0
- Bounty
- $692
Opened 17 days agoNever attempted - Let … be a finite set of size … and … be such that there is a function … so that for every … with … we have …. Prove that ….
Combinatorics
Erdős Problem 624
- Attempts
- 1
- Working
- 1
- Bounty
- $636
Opened 12 days agoLast attempt 21 days ago - Any graph on … vertices can be decomposed into … many edge-disjoint cycles and edges.
Combinatorics
In reviewErdős Problem 184
- Attempts
- 1
- Working
- 1
- Bounty
- $592
Opened 8 days agoLast attempt 3 days ago - Let … be an infinite set and consider the following greedy algorithm for a rational …: choose the minimal … such that … and repeat with … replaced by …. If this terminates after finitely many steps then this produces a representation of … as the sum of distinct unit fractions with denominators from …. Does this…
Combinatorics
Erdős Problem 282
- Attempts
- 0
- Working
- 0
- Bounty
- $536
Opened 3 days agoNever attempted