The indivisibility of the homogeneous \(K_ n\)-free graphs

DOI10.1016/0095-8956(89)90017-8zbMath0682.05048OpenAlexW2034730828MaRDI QIDQ1823962

Norbert W. Sauer, Mohamed H. El-Zahar

Publication date: 1989

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(89)90017-8

zbMATH Keywords

graph embeddinghomogeneous graphindivisible graphsquantifier block

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Graph theory (05C99)

Related Items (12)

On the divisibility of homogeneous hypergraphs ⋮ The Ramsey theory of Henson graphs ⋮ Partitions and indivisibility properties of countable dimensional vector spaces ⋮ Ramsey theory of homogeneous structures: current trends and open problems ⋮ Products of classes of finite structures ⋮ Forcing with copies of the Rado and Henson graphs ⋮ Henson graphs and Urysohn-Henson graphs as Cayley graphs ⋮ Age and weak indivisibility ⋮ A universal partition result for infinite homogeneous \(K_n\)-free and related graphs ⋮ The oscillation stability problem for the Urysohn sphere: a combinatorial approach ⋮ Structural Ramsey theory of metric spaces and topological dynamics of isometry groups ⋮ The Urysohn sphere is oscillation stable

Cites Work

• Coloring of universal graphs
• Theory of relations. Transl. from the French by P. Clote
• Countable Ultrahomogeneous Undirected Graphs
• A family of countable homogeneous graphs

This page was built for publication: The indivisibility of the homogeneous \(K_ n\)-free graphs