English

On $n$-saturated closed graphs

Combinatorics 2022-01-27 v1

Abstract

Geschke proved that there is clopen graph on 2ω2^\omega which is 3-saturated, but the clopen graphs on 2ω2^\omega do not even have infinite subgraphs that are 4-saturated; however there is FσF_\sigma graph that is ω1\omega_1-saturated. It turns out that there is no closed graph on 2ω2^\omega which is ω\omega-saturated. In this note we complete this picture by proving that for every nn there is an nn-saturated closed graph on the Cantor space 2ω2^\omega. 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

R2 v1 2026-06-24T09:03:40.029Z