{"paper":{"title":"Typical structure of hereditary graph families. II. Exotic examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Yelena Yuditsky","submitted_at":"2020-07-01T18:18:27Z","abstract_excerpt":"A graph $G$ is $H$-free if it does not contain an induced subgraph isomorphic to $H$. The study of the typical structure of $H$-free graphs was initiated by Erd\\H{o}s, Kleitman and Rothschild, who have shown that almost all $C_3$-free graphs are bipartite. Since then the typical structure of $H$-free graphs has been determined for several families of graphs $H$, including complete graphs, trees and cycles. Recently, Reed and Scott proposed a conjectural description of the typical structure of $H$-free graphs for all graphs $H$, which extends all previously known results in the area.\n  We const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00688","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.00688/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}