Ramsey numbers
The open problem: determine the Ramsey number R(5,5). It is known that 43 ≤ R(5,5) ≤ 46.
Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.
158 shown· page 4 of 4
The open problem: determine the Ramsey number R(5,5). It is known that 43 ≤ R(5,5) ≤ 46.
Wichmann's conjecture on optimal rulers. Every optimal ruler of sufficiently large length is a Wichmann ruler W(r, s) (up to reflection, i.e. reversing the segment list). Posed by Wichmann [Wi63].
Construct an S(t, k, n)-Steiner system with n > k > t > 5, t < 10, and n < 200. No example of a Steiner system with t > 5 is known, despite a 2014 existence theorem by Keevash showing that such systems must exist for sufficiently large n. Reference: Large Steiner Systems
F(n) ≤ n^3/2.
Every convex set in ℝ^3 has VC_2 dimension at most 2.
WOWII Conjecture 40 For a nontrivial connected graph G the size f(G) of a largest induced forest satisfies f(G) ≥ ceil((p(G) + b(G) + 1)/2) where p(G) is the path cover number and b(G) is the largest induced bipartite subgraph size.