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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
