>k-homogeneous infinite graphs
Combinatorics
2018-01-08 v3 Logic
Abstract
In this article we give an explicit classification for the countably infinite graphs which are, for some , -homogeneous. It turns out that a homogeneous graph is non-homogeneous if and only if it is either not homogeneous or not homogeneous, both cases which may be classified using ramsey theory.
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