Maximal chains of isomorphic subgraphs of the Rado graph

DOI10.1007/S10474-013-0341-9zbMath1313.05342OpenAlexW2083905094MaRDI QIDQ485527

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

Publication date: 9 January 2015

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-013-0341-9

zbMATH Keywords

maximal chaincompact setRado graphisomorphic copy

Mathematics Subject Classification ID

Partial orders, general (06A06) Random graphs (graph-theoretic aspects) (05C80) Total orders (06A05)

Related Items (4)

Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs ⋮ Forcing with copies of the Rado and Henson graphs ⋮ Copies of the random graph ⋮ On the structure of random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal chains of copies of the rational line
• Maximal chains in positive subfamilies of \(P(\omega )\)
• Maximal chains in interval algebras
• Maximal chains in atomic Boolean algebras
• The random graph
• Asymmetric graphs

This page was built for publication: Maximal chains of isomorphic subgraphs of the Rado graph