>k-homogeneous infinite graphs
Abstract
In this article we give an explicit classification for the countably infinite graphs G which are, for some k, ≥ k-homogeneous. It turns out that a ≥k-homogeneous graph M is non-homogeneous if and only if it is either not 1-homogeneous or not 2-homogeneous, both cases which may be classified using ramsey theory.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.