On $n$-saturated closed graphs
Combinatorics
2022-01-27 v1
Abstract
Geschke proved that there is clopen graph on which is 3-saturated, but the clopen graphs on do not even have infinite subgraphs that are 4-saturated; however there is graph that is -saturated. It turns out that there is no closed graph on which is -saturated. In this note we complete this picture by proving that for every there is an -saturated closed graph on the Cantor space . The key lemma is based on probabilistic argument. The final construction is an inverse limit of finite graphs.
Keywords
Cite
@article{arxiv.2201.10932,
title = {On $n$-saturated closed graphs},
author = {Szymon Głab and Przemysław Gordinowicz},
journal= {arXiv preprint arXiv:2201.10932},
year = {2022}
}
Comments
5 pages