Graph theorist spends 20 hours on OpenAI Math Dump, finds solutions to his decade-old conjectures
burny_tech · x · 2026-10-13
Graph theorist Hung Le (unsu) reports spending 20 hours reading one result from the OpenAI Math Dump, which includes solutions to the ℓ1-embedding conjectures for planar graphs and bounded-treewidth graphs — problems he and Arnold Filtser studied for over a decade.
Key points from his blog (Rambling on Graphs):
- Ongoing notes: Oct 10-11 added 6 more hours; he calls the writing of Sections 5-6 "a complete joke" with the real action in Sections 6-8
- Though unsettling, he believes understanding these proofs matters more than publishing another paper, hoping to learn the long-missing serious understanding of planar metrics
- He predicts the minor-free graph metrics ℓ1-embedding conjecture is next, sketching a Robertson-Seymour decomposition reduction
- "What a strange time to be alive."
More from Research
- Anthropic × Adaptyv protein design challenge 3: design a protein to activate GLP1R — victorgreiff · 2026-10-13
- Researcher: Artificial Life will be a key research direction as agentic AI gains self-replication and open-endedness — burny_tech · 2026-10-13
- van der Schaar Lab opens fully funded ML PhD positions for 2027 intake — MihaelaVDS · 2026-10-13
- Scientists identify the 'hangry neuron' in fruit flies that turns hunger into aggression — mjdramstead · 2026-10-13
- LLM cache verifier drift: reject-only calibration tripled error rate; 5% audits fix it — Reasonable_Royal_621 · 2026-10-13
- Sphere Eversion and the Turning Number: Why One Topological Invariant Underlies LLM Embedding Space — ctjlewis · 2026-10-13