There are four countable ultrahomogeneous graphs without triangles

DOI10.1016/0095-8956(79)90078-9zbMath0429.05044OpenAlexW1997180952MaRDI QIDQ1137597

Robert E. Woodrow

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90078-9

zbMATH Keywords

automorphismmatchingcomplete bipartite graphisomorphismelimination of quantifiersultrahomogeneousedgeless graphuniversal trianglefree countable graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other combinatorial set theory (03E05) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (5)

Some permutation representations of a free group ⋮ On countable homogeneous \(3\)-hypergraphs ⋮ Countable Ultrahomogeneous Undirected Graphs ⋮ Normal subgroups of infinite multiply transitive permutation groups ⋮ Cyclic automorphisms of a countable graph and random sum-free sets

Cites Work

• Unnamed Item
• On complete theories with a finite number of denumerable models
• Homogeneous graphs
• Homogeneous Universal Models.

This page was built for publication: There are four countable ultrahomogeneous graphs without triangles