Will Lean mathlib have a definition of planar graphs before the end of the year?
15
230Ṁ1873resolved Dec 31
Resolved
NO1H
6H
1D
1W
1M
ALL
Planar graphs are surprisingly difficult to formalize. The textbook definition (can be drawn on a plane) is easy to understand, but in code that explodes into a mess of coordinate geometry.
Georges Gonthier, in his proof of the four-color theorem, used a structure called combinatorial hypermaps to encode planar graphs. This approach seems most promising. Before proposing that to mathlib, it would be nice to check that it's suitable for all planar graph theorems, not just four-color.
Resolves YES if mathlib has a definition of planar graph. The code must be on the master branch. Alternative definitions of graphs (like hypermaps) are allowed, as long as there is an embedding from SimpleGraph that preserves planarity.
This question is managed and resolved by Manifold.
Get
1,000 to start trading!
🏅 Top traders
# | Name | Total profit |
---|---|---|
1 | Ṁ52 | |
2 | Ṁ37 | |
3 | Ṁ31 | |
4 | Ṁ28 | |
5 | Ṁ25 |
People are also trading
Related questions
Which theorems will be formally proven in Lean by the end of 2028?
What tactic will prove the most mathlib lemmas at the end of 2026?
Will Terence Tao write a paper with Lean code in it during the 2026 calendar year?
79% chance
Will fermats last theorem be formalized in lean down to the axiom in 5 years.
49% chance