Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs

DOI10.1016/J.AIM.2014.07.011MaRDI QIDQ401003zbMATH OpenOpenAlexFDO

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

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

compact setmaximal chainHenson graphsisomorphic subgraphrado graphultrahomogeneous graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Partial orders, general (06A06) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Models with special properties (saturated, rigid, etc.) (03C50) Infinite graphs (05C63) Total orders (06A05) Model theory of denumerable and separable structures (03C15)

Abstract: For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U {o} ordered by the inclusion are characterized as: (I) the order types of compact sets of reals having the minimum non-isolated, if G is the Rado graph or the Henson graph H_n, for some n>2; (II) the order types of compact nowhere dense sets of reals having the minimum non-isolated, if G is the union of mu disjoint complete graphs of size

u, where mu

u =omega .

Recommendations

• Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
• Positive families and Boolean chains of copies of ultrahomogeneous structures
• Maximal chains of isomorphic subgraphs of the Rado graph
• Countable connected-homogeneous graphs
• Maximal antichains of isomorphic subgraphs of the Rado graph

Cites work

• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• A family of countable homogeneous graphs
• Chains in Boolean algebras
• Countable Ultrahomogeneous Undirected Graphs
• Maximal chains in atomic Boolean algebras
• Maximal chains in interval algebras
• Maximal chains in positive subfamilies of P( )
• Maximal chains of copies of the rational line
• Maximal chains of isomorphic subgraphs of the Rado graph
• Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
• Towers and maximal chains in Boolean algebras

Cited in

(8)

• Positive families and Boolean chains of copies of ultrahomogeneous structures
• Maximal chains of isomorphic subgraphs of the Rado graph
• Forcing with copies of the Rado and Henson graphs
• On the structure of random hypergraphs
• Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
• Antichains of copies of ultrahomogeneous structures
• Maximal antichains of isomorphic subgraphs of the Rado graph
• Graphs and models with finite chains

This page was built for publication: Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs

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