Hereditary properties of hypergraphs
From MaRDI portal
Publication:1003850
DOI10.1016/j.jctb.2008.09.004zbMath1219.05104OpenAlexW1976891017MaRDI QIDQ1003850
Publication date: 4 March 2009
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2008.09.004
Related Items (8)
Counting \(r\)-graphs without forbidden configurations ⋮ Supersaturation for hereditary properties ⋮ The structure of almost all graphs in a hereditary property ⋮ Simple Containers for Simple Hypergraphs ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Almost all triangle-free triple systems are tripartite ⋮ Hypergraph containers ⋮ Extended box clustering for classification problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A variant of the hypergraph removal lemma
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The asymptotic number of graphs not containing a fixed color-critical subgraph
- On the size of hereditary classes of graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- An Algorithmic Version of the Hypergraph Regularity Method
- Excluding induced subgraphs: quadrilaterals
- Excluding Induced Subgraphs III: A General Asymptotic
- On the entropy values of hereditary classes of graphs
- On sets of integers containing k elements in arithmetic progression
- Extremal problems on set systems
- Hereditary Properties of Triple Systems
- Regularity Lemma for k-uniform hypergraphs
- Projections of Bodies and Hereditary Properties of Hypergraphs
- The hypergraph regularity method and its applications
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- On the structure of linear graphs
- The asymptotic number of triple systems not containing a fixed one
This page was built for publication: Hereditary properties of hypergraphs