Maximal chains of isomorphic subgraphs of the Rado graph

DOI10.1007/S10474-013-0341-9zbMATH Open1313.05342OpenAlexW2083905094MaRDI QIDQ485527FDOQ485527

Authors: 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

Recommendations

• Maximal antichains of isomorphic subgraphs of the Rado graph
• Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
• Maximal chordal subgraphs
• scientific article; zbMATH DE number 637283
• scientific article; zbMATH DE number 3847425
• Toward a graph version of Rado's theorem
• Maximum subgraphs in Ramsey graphs
• Graphs isomorphic to their maximum matching graphs
• On maximal chain subgraphs and covers of bipartite graphs
• A graphical characterization of the largest chain graphs

zbMATH Keywords

compact setRado graphisomorphic copymaximal chain

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The random graph
• Asymmetric graphs
• Title not available (Why is that?)
• Maximal chains of copies of the rational line
• Maximal chains in atomic Boolean algebras
• Maximal chains in positive subfamilies of \(P(\omega )\)
• Maximal chains in interval algebras

Cited In (6)

• Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
• Another look at the Erdős-Hajnal-Pósa results on partitioning edges of the Rado graph
• Forcing with copies of the Rado and Henson graphs
• On the structure of random hypergraphs
• Copies of the random graph
• Maximal chains of copies of the rational line

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

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