A note on the indivisibility of the Henson graphs
Logic
2023-11-01 v1 Combinatorics
Abstract
We show that in contrast to the Rado graph, the Henson graphs are not computably indivisible.
Cite
@article{arxiv.2310.20097,
title = {A note on the indivisibility of the Henson graphs},
author = {Kenneth Gill},
journal= {arXiv preprint arXiv:2310.20097},
year = {2023}
}
Comments
4 pages. This work also appears as part of the author's Ph.D. thesis