>k-homogeneous infinite graphs

Abstract

In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\ge$$k$-homogeneous. It turns out that a $\ge$$k-$homogeneous graph $\mathcal{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.

14 pages, 2 figures

References in corpus (1)

• Homogenizable structures and model completeness