Track new results across pure and applied mathematics.
Search papers, labs, and topics across Lattice.
University College London
2
0
0
Minimal Hall ratios in $k$-uniform hypergraphs ($k \ge 3$) do not guarantee bounded chromatic numbers, shattering a potential generalization of graph coloring principles.
An LLM-discovered counterexample based on Suzuki-Tits ovoid geometry has officially refuted the dominating Hadwiger conjecture.