There are four countable ultrahomogeneous graphs without triangles

DOI10.1016/0095-8956(79)90078-9MaRDI QIDQ1137597zbMATH OpenOpenAlexFDO

Authors R. 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

automorphismcomplete bipartite graphedgeless graphelimination of quantifiersisomorphismmatchingultrahomogeneousuniversal trianglefree countable graph

Mathematics Subject Classification ID

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

Cites work

• Homogeneous graphs
• Homogeneous Universal Models.
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• On complete theories with a finite number of denumerable models

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1137597)