Paper Info
Title
>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.
Year
DOI
Venue
2018
10.1016/j.jctb.2017.08.007
Journal of Combinatorial Theory, Series B
Keywords
DocType
Volume
>k-homogeneous,Classification,Countably infinite graph
Journal
128
Issue
ISSN
Citations 
C
0095-8956
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Ove Ahlman131.57