English

>k-homogeneous infinite graphs

Combinatorics 2018-01-08 v3 Logic

Abstract

In this article we give an explicit classification for the countably infinite graphs G\mathcal{G} which are, for some kk, \geqk k-homogeneous. It turns out that a \geqkk-homogeneous graph M\mathcal{M} is non-homogeneous if and only if it is either not 11-homogeneous or not 22-homogeneous, both cases which may be classified using ramsey theory.

Keywords

Cite

@article{arxiv.1601.07307,
  title  = {>k-homogeneous infinite graphs},
  author = {Ove Ahlman},
  journal= {arXiv preprint arXiv:1601.07307},
  year   = {2018}
}

Comments

14 pages, 2 figures

R2 v1 2026-06-22T12:37:38.828Z