Factor of iid colorings of trees
Combinatorics
2024-02-06 v1 Logic
Probability
Abstract
We show that, for every , the 4-regular tree has an fiid 4-coloring where a given vertex is assigned the 4th color with probability at most . We also construct 5-colorings of improving known bounds on the measurable and approximate chromatic number of .
Keywords
Cite
@article{arxiv.2402.02575,
title = {Factor of iid colorings of trees},
author = {Riley Thornton},
journal= {arXiv preprint arXiv:2402.02575},
year = {2024}
}