Factor of iid colorings of trees
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913223075168256 |
|---|---|
| author | Thornton, Riley |
| author_facet | Thornton, Riley |
| contents | We show that, for every $ε>0$, 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 $T_6$ improving known bounds on the measurable and approximate chromatic number of $F_3$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_02575 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Factor of iid colorings of trees Thornton, Riley Combinatorics Logic Probability 03E15 (primary), 05C15, 60K35 (secondary) We show that, for every $ε>0$, 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 $T_6$ improving known bounds on the measurable and approximate chromatic number of $F_3$. |
| title | Factor of iid colorings of trees |
| topic | Combinatorics Logic Probability 03E15 (primary), 05C15, 60K35 (secondary) |
| url | https://arxiv.org/abs/2402.02575 |