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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Typical Structure of Hereditary Graph Families. I. Apex‐free Families

Sergey Norin, Yelena Yuditsky
Random Structures and Algorithms
Advanced Graph Theory Research
article

Typical Structure of Hereditary Graph Families. I. Apex‐free Families

Sergey Norin, Yelena Yuditsky
article en

Abstract

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).

Random Structures and AlgorithmsVol. 66(1)
Université Libre de Bruxelles (BE), McGill University (CA)
Openalex Percentile: Top 74%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.