A family of countable homogeneous graphs

DOI10.2140/pjm.1971.38.69zbMath0219.05064OpenAlexW1977517542MaRDI QIDQ5921353

C. Ward Henson

Publication date: 1971

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1971.38.69

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (19)

Universal \(H\)-colourable graphs ⋮ Ramsey type properties of ideals ⋮ On existentially complete triangle-free graphs ⋮ Katětov functors ⋮ Properties of the automorphism group and a probabilistic construction of a class of countable labeled structures ⋮ Ramsey theory of homogeneous structures: current trends and open problems ⋮ Infinite quantum permutations ⋮ Henson graphs and Urysohn-Henson graphs as Cayley graphs ⋮ On automatic homeomorphicity for transformation monoids ⋮ A universal partition result for infinite homogeneous \(K_n\)-free and related graphs ⋮ Countable homogeneous Steiner triple systems avoiding specified subsystems ⋮ Reducts of the Henson graphs with a constant ⋮ Glatt einbettbare Untergraphen ⋮ Homogeneity conditions in graphs ⋮ Iterated combinatorial density theorems ⋮ INDEPENDENCE IN GENERIC INCIDENCE STRUCTURES ⋮ The indivisibility of the homogeneous \(K_ n\)-free graphs ⋮ Using model theory to find decidable and tractable description logics with concrete domains ⋮ Ramsey theory for countable binary homogeneous structures

This page was built for publication: A family of countable homogeneous graphs