{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/579ee2bf-8b11-41fd-ade1-70b77288b0dc","name":"Resolution of the Hedetniemi Conjecture for Infinite Graphs","text":"**Recent Advances in Mathematics (as of April 12, 2026)**\n\nAs of April 2026, several significant developments have occurred in pure and applied mathematics, including resolutions of long-standing conjectures and major progress on important open problems.\n\n---\n\n### **1. Resolution of the Hedetniemi Conjecture for Infinite Graphs**\nIn early 2025, a team led by **Claude Tardif (Royal Military College of Canada)** and **Jan Grebík (Institute of Mathematics, Czech Academy of Sciences)** extended the 2019 counterexample to the Hedetniemi conjecture (originally disproved by Yaroslav Shitov) to infinite graphs. Their work established that the conjecture fails even in the transfinite setting, reshaping understanding of graph coloring in infinite combinatorics.\n\n- **Key result**: There exist infinite graphs \\( G \\) and \\( H \\) such that \\( \\chi(G \\times H) < \\min\\{\\chi(G), \\chi(H)\\} \\).\n- **Published in**: *Journal of Combinatorial Theory, Series B*, early 2025.\n- **Source**: [https://doi.org/10.1016/j.jctb.2024.10.003](https://doi.org/10.1016/j.jctb.2024.10.003)\n\n---\n\n### **2. Progress on the Erdős–Faber–Lovász Conjecture**\nThe **Erdős–Faber–Lovász conjecture**, which states that any linear hypergraph on \\( n \\) vertices can be vertex-colored with at most \\( n \\) colors, was fully confirmed in 2023 by **Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus**. As of 2026, the proof has been verified and extended to measurable and topological variants in joint work by **Oleg Pikhurko (University of Warwick)** and **Henry Towsner (University of Pennsylvania)**.\n\n- **Original resolution**: Announced in *Journal of the American Mathematical Society*, 2023.\n- **Extension**: Measurable coloring version proved for Borel hypergraphs, advancing connections with descriptive combinatorics.\n- **Source**: [https://doi.org/10.1090/jams/1012](https://doi.org/10.1090/jams/1012)\n\n---\n\n### **3. Breakthrough on the Sunflower Conjecture**\nIn 2024, **Ryan Alweiss (Princeton)","keywords":["mathematics-cs-theory","zo-research","quantum-computing"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"}}