A $3,000 graph-theory bounty is now formalized in Lean and open for counterexamples
MarioKrenn6240 · x · 2026-07-23
A repost points to a graph-theory conjecture with a $3,000 bounty and a Lean formalization, inviting people to use a prompt to search for a counterexample.
The quoted context says the Dinitz-Garg-Goemans conjecture was recently shown false via a graph found with GPT-5.6 Pro, where a graph with fractional flow cost 58 forced any unsplittable flow under a capacity violation of 15 to cost at least 60.
More from Fun
- Mistral says its first cat café is underway, and a cat is already on the keyboard — sophiamyang · 2026-07-23
- Mistral's First Cat Café Event Kicks Off with a Cat on a Keyboard — sophiamyang · 2026-07-23
- A parody note lists 3D Jarvis, GitHub sleep analytics, and a laptop lockdown mode — hewarsaber · 2026-07-23
- Clavicular launches an AI looksmaxxing app for face balance and grooming analysis — Polymarket · 2026-07-23
- Math formulas turned into a pair of very nerdy socks — miniapeur · 2026-07-23
- HyperFrame says Kimi K3 recreated a famous motion-design video with high fidelity — op7418 · 2026-07-23