2018/01/16 by Victor Falgas‐Ravry, Falgas-Ravry, Victor, Kelly O'Connell +3 · 1 citation
Computer Science · Mathematics · #05A15 #05C65 #05D99 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1801.05195
openalex publication_date 2018/01/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In breakthrough results, Saxton-Thomason and Balogh-Morris-Samotij developed powerful theories of hypergraph containers. In this paper, we explore some consequences of these theories. We use a simple container theorem of Saxton-Thomason and an entropy-based framework to deduce container and counting theorems for hereditary properties of k-colourings of very general objects, which include both vertex- and edge-colourings of general hypergraph sequences as special cases. In the case of sequences of complete graphs, we further derive characterisation and transference results for hereditary properties in terms of their stability families and extremal entropy. This covers within a unified framework a great variety of combinatorial structures, some of which had not previously been studied via containers: directed graphs, oriented graphs, tournaments, multigraphs with bounded multiplicity and multicoloured graphs amongst others. Similar results were recently and independently obtained by Terry.