{"id":"palomar/PALOMAR-2026-09-18-000003","url":"https://github.com/gdahia/komlos/tree/d802857449234318d557361b1dbb0a27e0258528","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-09-18-000003-v1.json","repo":"https://github.com/gdahia/komlos","tags":["math.CO","cs.DM","msc:11K38","msc:05C65","msc:05D40","msc:68R05","discrepancy-theory","combinatorics","lean-formalization"],"score":0,"title":"Komlós conjecture","trust":"high","domain":"math.CO","source":"palomar","authors":["Gabriel Dahia"],"reviews":0,"subject":"math.CO","summary":"Lean4 formalization of the Komlós bound with constant 36 following the Lovett—Karingula exposition. The Komlós statement gives signs for finitely many vectors of Euclidean norm at most 1 so that the signed sum has supremum norm at most 36. The Beck–Fiala statement gives a vertex colouring with edge discrepancy at most 36√t when every vertex belongs to at most t edges.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-09-18","reactions":{},"formalized":true,"formalizes":[{"title":"An elementary proof of the Komlós conjecture","identifier":"ECCC TR26-188","relationship":"formalizes"}]}