Paper detail

On $n$-saturated closed graphs

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.

preprint2022arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.