On n -saturated Closed Graphs
Results in Mathematics(2022)
摘要
Geschke proved in [ 2 ] that there is a 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, see [ 3 ]. 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.
更多查看译文
关键词
n-saturated graph,topological graph,closed graph,inverse limit,Primary 05C63,Secondary 05C60
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要