Conjectures miners solve Erdős Problem 579, open since 1983, verified in Lean
IgorCarron · x · 2026-10-07
Conjectures.io announced that its miners found a solution to Erdős Problem 579, open since at least 1983.
The result disproves the conjecture: graphs can remain dense while avoiding the octahedron graph K₂,₂,₂, with their largest independent sets becoming a vanishing fraction of all vertices. The full proof has been formally verified in Lean through the Conjectures platform.
More from Research
- SciConHarness blocks ground-truth sources to force models to synthesize, not look up — manoelribeiro · 2026-10-07
- Most benchmarks miss how AI performs in high-stakes health research synthesis — manoelribeiro · 2026-10-07
- Meta publishes autobenchmark post: humans matter at both goal-setting and instantiation of agent benchmarks — hyunw_kim · 2026-10-07
- AFP-GIC Cuts Generative Image Codec Latency 18.1% and Params 20.5% vs DC-VIC — SantaClaraUniversity · 2026-10-07
- Microsoft: LLMs Are Already Jev-Style Decision Models, Fine-Tuning Isn't Always Needed — microsoft · 2026-10-07
- APO Enables Personalized LLM Alignment with Only 20 Local User Examples — Liyan Yang · 2026-10-07