Paperlane

no. 7 · Tuesday 3 November 2026

Proving the Komlós conjecture slowly

Lawrence Hollom

math.CO · 30 pp

Abstract

The Komlós conjecture was a long-standing open problem in discrepancy theory until it was recently solved in a flurry of AI developments. We give a motivated exposition of an elementary proof of the conjecture due to Karingula and Lovett, as well as a counterexample to the strong Komlós conjecture due to Kintali, aiming to introduce the ideas in a gentle and explained manner in order to ease the understanding of the proofs. We conclude with several problems which remain open.

comments
30 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.03427 ↗