There is no universal countable random-free graph

DOI10.1016/j.disc.2004.01.002zbMath1042.05090arXivmath/0106102OpenAlexW2008047818MaRDI QIDQ1827759

Masasi Higasikawa

Publication date: 6 August 2004

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

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

zbMATH Keywords

Random graphInfinite graphStrong embeddability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99)

Cites Work

• Unnamed Item
• Universal elements and the complexity of certain classes of infinite graphs
• On the order of countable graphs
• Representing Embeddability as Set Inclusion
• Some remarks on universal graphs

This page was built for publication: There is no universal countable random-free graph