Prefer a chat interface with context about you and your work?
Another Approach to Non-Repetitive Colorings of Graphs of Bounded Degree
We propose a new proof technique that applies to the same problems as the Lovász Local Lemma or the entropy-compression method. We present this approach in the context of non-repetitive colorings and we use it to improve upper-bounds relating different non-repetitive chromatic numbers to the maximal degree of a graph. …