Combinatorics of Dyadic Intervals: Consistent Colorings

2014/09/07 by Anna Kamont, Kamont, Anna, Paul F. X. Muller +1
Mathematics · #05A18 91A05 #Combinatorics (math.CO) #FOS: Mathematics #Functional Analysis (math.FA) #math.CO #math.FA #msc:05A18 #msc:91A05

paper · pdf · doi:10.48550/arxiv.1409.2161

arXiv admin note: text overlap with arXiv:0909.4926

arxiv created 2014/09/07 · arxiv updated 2014/09/09

Abstract

We study the problem of consistent and homogeneous colourings for increasing families of dyadic intervals. We determine when this problem can be solved and when not.

Citations

• Rearrangements with supporting Trees, Isomorphisms and Combinatorics of coloured dyadic Intervals

Related

• Strong Conflict-Free Coloring of Intervals
• Another Note on Intervals in the Hales-Jewett Theorem
• Intervals in the Hales-Jewett theorem
• Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
• Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy