Maximal antichains of isomorphic subgraphs of the Rado graph

DOI10.2298/FIL1509919KzbMath1464.05329OpenAlexW3023907760MaRDI QIDQ5278717

Miloš S. Kurilić, Petar Marković

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1509919k

zbMATH Keywords

partial orderRado graphisomorphic subgraphmaximal antichainmad familiesalmost disjoint families

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Antichains of copies of ultrahomogeneous structures ⋮ Forcing with copies of the Rado and Henson graphs ⋮ Copies of the random graph

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