Typical Structure of Hereditary Graph Families. I. Apex‐free Families
ABSTRACT A family of graphs is hereditary if is closed under isomorphism and taking induced subgraphs. The speed of is the sequence , where denotes the set of graphs in with the vertex set . Alon et al. (2011) gave a rough description of typical graphs in a hereditary family and used it to show for every proper hereditary family there exist and an integer such that The main result of this paper gives a more precise description of typical structure for a restricted class of hereditary families. As a consequence we characterize hereditary families with the speed just above the threshold , generalizing a result of Balogh and Butterfield (2011).
Authors
- Sergey Norin (ORCID: https://orcid.org/0000-0003-4833-7983)
- Yelena Yuditsky (ORCID: https://orcid.org/0000-0002-6467-3437)
Institutions
- Université Libre de Bruxelles (BE)
- McGill University (CA)
Publication Details
- Journal
- Random Structures and Algorithms
- Published
- 2024-11-29
- DOI
- https://doi.org/10.1002/rsa.21271
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00