Komlós Conjecture reportedly solved with a ~1-page proof, sparking debate
gautamcgoel · x · 2026-09-22
- Word is circulating that the famous Komlós conjecture in combinatorics may have been solved — with a proof of only about one page.
- @gautamcgoel asks the obvious follow-up: could this proof plausibly have been found 30 years ago? If so, why wasn't it?
- The question probes whether the proof was an inevitable consequence of accumulated tools or required a genuinely new idea.
More from Research
- O'Reilly builds a working data vocabulary for the semantic era, from warehouses to ontologies — rseroter · 2026-09-22
- Glance reads structured visual answers from a frozen 4B VLM, cutting GPU cost up to 85% — multiply_matrix · 2026-09-22
- SkillLift cuts agent skill-evolution token cost 40-70% by ranking, not rollouts — dair_ai · 2026-09-22
- FAIR & NYU scaling law paper pushes fits down to 4M-param models — giffmana · 2026-09-22
- Salesforce: Fine-tuning a weak model to copy Gemini drops success 15%; correcting its own failures works — rohanpaul_ai · 2026-09-22
- Jevons effect sparks encoder model revival: 'BERT revenge' over GPT — JFPuget · 2026-09-22