Combinatorics of Dyadic Intervals: Consistent Colorings
classification
🧮 math.FA
math.CO
keywords
consistentdyadicintervalsproblemwhencoloringscolouringscombinatorics
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.