pith. sign in

arxiv: 1601.07307 · v3 · pith:FFZXOHWRnew · submitted 2016-01-27 · 🧮 math.CO · math.LO

>k-homogeneous infinite graphs

classification 🧮 math.CO math.LO
keywords homogeneousgraphsinfinitemathcalarticlecasesclassificationclassified
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.