On n-saturated closed graphs

Abstract

Geschke proved that there is clopen graph on 2ω which is 3-saturated, but the clopen graphs on 2ω do not even have infinite subgraphs that are 4-saturated; however there is Fσ graph that is ω1-saturated. It turns out that there is no closed graph on 2ω which is ω-saturated. In this note we complete this picture by proving that for every n there is an n-saturated closed graph on the Cantor space 2ω. The key lemma is based on probabilistic argument. The final construction is an inverse limit of finite graphs.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…