Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

Ten Challenges

A collective effort to tackle ten open problems in combinatorics, formalized in Lean 4. Each challenge is scaled by a parameter rrr: small values are known results, larger ones are open, and every mission here lists the known rungs and the first open one as milestones. Let's prove new cases and push the known bounds forward. The Lean definitions are those of the public Ten Challenges repository, so a proof of a goal or of any rung produced here is also welcome on:

Ten Challenges website

where accepted submission appear in the leaderboard (with public and private tracks).

10 open missions

Missions

1–10 of 10
Open10Completed0All10
Graph Theory·Captain: LG

Hadwiger's ConjectureOpen Problem

Hadwiger's conjecture (1943) asserts that for every integer t≥0t\ge 0t≥0, every graph with no Kt+1K_{t+1}Kt+1​ minor is ttt-colourable. It is a far-reaching strengthening of the four-colour theorem, and it is widely described as one of the central open problems of graph theory (Bollobás, Catlin and Erdős called it "one of the deepest unsolved problems in graph theory"). The…

16 thms4 active usersReviewed
CombinatoricsExtremal Graph TheoryGraph Theory·Captain: utkuokur

Ten Challenges 04: Sidorenko's conjecture for bipartite graphs with bounded sidesOpen Problem

How many copies of a fixed graph HHH must a graph GGG of given edge density contain? For bipartite HHH, Sidorenko's conjecture gives the cleanest possible answer: the random graph of the same density contains the fewest, so the homomorphism density of HHH in GGG is at least the edge density of GGG raised to the number of edges of HHH. The statement was conjectured…

9 thms3 active usersReviewed
CombinatoricsGraph TheoryMathematical Logic·Captain: utkuokur

Ten Challenges 06: Better-quasi-ordering of finite graphs under minorsOpen Problem

The Graph Minor Theorem of Robertson and Seymour states that finite graphs are well-quasi-ordered by the minor relation: in every infinite sequence of finite graphs, some graph is a minor of a later one. It is one of the deepest results of combinatorics, and it implies that every minor-closed class of graphs is characterised by finitely many excluded…

23 thms3 active usersReviewed
CombinatoricsGraph TheoryMathematical Logic·Captain: utkuokur

Ten Challenges 10: Unfriendly partition conjectureOpen Problem

A partition of the vertices of a graph into two classes is unfriendly if every vertex has at least as many neighbours in the other class as in its own. Every finite graph has one: a partition with the maximum number of crossing edges. For infinite graphs the question is the unfriendly partition conjecture of Cowan and Emerson: does every countable graph…

10 thms3 active usersReviewed
Discrete Geometry·Captain: utkuokur

Ten Challenges 07: Sphere packings versus lattice packingsOpen Problem

The sphere packing problem asks for the largest fraction of Rd\mathbb R^dRd that can be covered by non-overlapping unit balls. The densest packings known in most dimensions are lattice packings, whose centres form a lattice, and for d∈{1,2,3,8,24}d\in\{1,2,3,8,24\}d∈{1,2,3,8,24} a lattice packing is known to be optimal among all packings. But in several dimensions, d=10d=10d=10 being the first,…

9 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: utkuokur

Ten Challenges 03: Caccetta–Häggkvist conjectureOpen Problem

In a finite directed graph in which every vertex has an out-neighbour, following arcs must eventually return to a visited vertex, so a directed cycle exists; but it may be long. The Caccetta–Häggkvist conjecture quantifies how large minimum out-degree forces short directed cycles: out-degree at least rrr on nnn vertices should force a directed cycle of length…

9 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: utkuokur

Ten Challenges 05: Erdős–Hajnal conjecture for pathsOpen Problem

Ramsey's theorem guarantees that every graph on nnn vertices has a clique or an independent set of size about 12log⁡2n\tfrac12\log_2 n21​log2​n, and random graphs show that this is best possible. The Erdős–Hajnal conjecture says that forbidding any single induced subgraph HHH changes the picture completely: HHH-free graphs should contain cliques or independent sets of polynomial…

6 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: utkuokur

Ten Challenges 08: Ryser's hypergraph conjectureOpen Problem

For bipartite graphs, Kőnig's theorem says that the minimum number of vertices needed to meet every edge equals the maximum number of pairwise disjoint edges: τ=ν\tau=\nuτ=ν. For hypergraphs whose edges have rrr vertices, the ratio τ/ν\tau/\nuτ/ν can be as large as rrr in general, and the bound τ≤rν\tau\le r\nuτ≤rν is trivial. Ryser's conjecture asserts that for rrr-partite rrr-uniform…

6 thms2 active usersReviewed
CombinatoricsExtremal Set Theory·Captain: utkuokur

Ten Challenges 09: Union-closed sets conjectureOpen Problem

A family of finite sets is union-closed if the union of any two members is again a member. The union-closed sets conjecture, attributed to Frankl (1979), asserts that every such family, other than the two degenerate ones ∅\emptyset∅ and {∅}\{\emptyset\}{∅}, has an element that lies in at least half of its members. Despite its elementary statement the conjecture…

6 thms2 active usersReviewed
Combinatorics·Captain: utkuokur

Ten Challenges 02: Excluded minors for GF(pm)\mathrm{GF}(p^m)GF(pm)-representable matroidsOpen Problem

A matroid records which subsets of a finite set are independent, in the way that sets of columns of a matrix are linearly independent or sets of edges of a graph are acyclic. The matroids that come from matrices over a field F\mathbb FF are the F\mathbb FF-representable matroids, and deciding which matroids are representable over a given finite field is one of…

6 thms1 active userReviewed

Top contributors

RankContributorAccepted solutionsSubmitted problems
1KMkmehltretter8283
2FIfizzyinc360
3DADavide48
4SHshivm20
5LGLG116
5MAmarwahaha10
5MOmoona3k10
5NINickrobbins9510
5NOnonlocally10
10MImikedeng108

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me