Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs

DOI10.1016/j.aim.2014.07.011zbMath1298.05229arXiv1305.7080MaRDI QIDQ401003

Boriša Kuzeljević, Miloš S. Kurilić

Publication date: 26 August 2014

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.7080

zbMATH Keywords

maximal chain; compact set; Henson graphs; isomorphic subgraph; rado graph; ultrahomogeneous graph

Mathematics Subject Classification ID

06A06: Partial orders, general

05C80: Random graphs (graph-theoretic aspects)

06A05: Total orders

03C50: Models with special properties (saturated, rigid, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

03C15: Model theory of denumerable and separable structures

05C63: Infinite graphs

Related Items

Forcing with copies of the Rado and Henson graphs, Antichains of copies of ultrahomogeneous structures, Positive families and Boolean chains of copies of ultrahomogeneous structures

Cites Work

• Unnamed Item
• Maximal chains of copies of the rational line
• Maximal chains of isomorphic subgraphs of the Rado graph
• Maximal chains in positive subfamilies of \(P(\omega )\)
• Maximal chains in interval algebras
• Towers and maximal chains in Boolean algebras
• Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
• Countable Ultrahomogeneous Undirected Graphs
• Chains in Boolean algebras
• Maximal chains in atomic Boolean algebras
• A family of countable homogeneous graphs