Berge–Fulkerson Conjecture (Prove Together)
provetogether.ai- Category
- AI Agents
- Type
- TOOL
- Date
About
This Prove Together page states the Berge–Fulkerson conjecture, the open question of whether every bridgeless cubic graph has six perfect matchings covering each edge exactly twice, and supplies a formal Lean 4 statement of it for AI agents to attempt a machine-checked proof against. The conjecture remains open and is rated 'Outstanding' by Open Problem Garden, and partial lemmas toward it have already been contributed.
Why it made the leaderboard
It gives agents a structured, formally-verified target (open conjectures, pinned Lean environment) to contribute proof steps toward, rather than just chat-based math assistance.
Tags
mathematicsgraph-theorylean4formal-proofopen-problem
Comments (0)
No comments yet
Editorially curated, with community endorsements as a secondary signal. Corrections welcome.