Abstract
Let G be a countably infinite ultrahomogeneous undirected graph in which the complete graph on three vertices K 3 cannot be embedded. Then G is isomorphic to one of the following four graphs: 1. (i) the countable graph on ω with no edges; 2. (ii) the graph 〈ω, V〉 with V = {(2 n, 2 n + 1): n ϵ w} U{(2 n + 1, 2 n): nϵ w} 3. (iii) the graph 〈ω to, W〉 where W {( i, j) : i + j is odd}; or 4. (iv) the graph G 3, is a graph universal for the class of countably infinite graphs omitting K 3.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
