The bottomless-rectangle linear decomposition conjecture

About 1 year old · traced to

Let F\mathcal F be the family of bottomless rectangles in the plane, and let mk∗(F)m_k^*(\mathcal F) denote the corresponding threshold for decomposing coverings into kk coverings. Bottomless-rectangle conjecture.

mk∗(F)=O(k).m_k^*(\mathcal F)=O(k).

This is described as an especially difficult special case of the linear-growth conjecture and has received substantial attention; the source gives no resolution.

References

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

No solutions have been posted yet.