Colouring bottomless rectangles and arborescences
Jean Cardinal, Kolja Knauer, Piotr Micek, D\"om\"ot\"or P\'alv\"olgyi,, Torsten Ueckerdt, Narmada Varadarajan

TL;DR
This paper investigates the limitations of semi-online colouring algorithms for bottomless rectangles and arborescences, revealing fundamental bounds and proposing improved bounds for polychromatic colourings.
Contribution
It establishes impossibility results for semi-online algorithms in colouring bottomless rectangles and arborescences, and provides new bounds for polychromatic colouring numbers in various rectangle families.
Findings
Semi-online algorithms cannot guarantee multi-colour coverage for bottomless rectangles.
Any semi-online arborescence colouring produces arbitrarily long monochromatic paths.
For certain rectangle families, the polychromatic k-colouring number is linear in k.
Abstract
We study problems related to colouring bottomless rectangles. One of our main results shows that for any positive integers , there is no semi-online algorithm that can -colour bottomless rectangles with disjoint boundaries in increasing order of their top sides, so that any -fold covered point is covered by at least two colours. This is, surprisingly, a corollary of a stronger result for arborescence colourings. Any semi-online colouring algorithm that colours an arborescence in leaf-to-root order with a bounded number of colours produces arbitrarily long monochromatic paths. This is complemented by optimal upper bounds given by simple online colouring algorithms from other directions. Our other main results study configurations of bottomless rectangles in an attempt to improve the \textit{polychromatic -colouring number}, . We show that for many families of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Computational Geometry and Mesh Generation
