Typical Structure of Hereditary Graph Families. II. Exotic Examples
Typical Structure of Hereditary Graph Families. II. Exotic Examples
ABSTRACT A graph is ‐free if it does not contain an induced subgraph isomorphic to . The study of the typical structure of ‐free graphs was initiated by Erdős, Kleitman, and Rothschild (1976), who have shown that almost all ‐free graphs are bipartite. Since then the typical structure of ‐free …