The bottomless-rectangle linear decomposition conjecture
The bottomless-rectangle linear decomposition conjecture
Let be the family of bottomless rectangles in the plane, and let denote the corresponding threshold for decomposing coverings into coverings. Bottomless-rectangle conjecture.
This is described as an especially difficult special case of the linear-growth conjecture and has received substantial attention; the source gives no resolution.
Sources & referencesView supporting material
Primary source
Gábor Damásdi, Balázs Keszegh, János Pach, Dömötör Pálvölgyi and Géza Tóth, “Coloring Geometric Hypergraphs: A Survey”, arXiv:2512.09509 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.