Smooth graphs
Abstract
A graph G on omega1 is called <omega-smooth if for each uncountable subset W of omega1, G is isomorphic to G[W-W'] for some finite W'. We show that in various models of ZFC if a graph G is <omega-smooth then G is necessarily trivial, i.e, either complete or empty. On the other hand, we prove that the existence of a non-trivial, <omega-smooth graph is also consistent with ZFC.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.