Hereditary Properties of Triple Systems

DOI10.1017/S0963548302005503zbMath1027.05072OpenAlexW2107360625MaRDI QIDQ4802166

Yoshiharu Kohayakawa, Vojtěch Rödl, Brendan Nagle

Publication date: 7 January 2004

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548302005503

zbMATH Keywords

uniform hypergraphhereditary propertyforbidden class

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65)

Related Items (10)

On characterizing hypergraph regularity ⋮ Counting \(r\)-graphs without forbidden configurations ⋮ The structure of almost all graphs in a hereditary property ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Note on the 3-graph counting Lemma ⋮ Hypergraph containers ⋮ Counting subgraphs in quasi‐random 4‐uniform hypergraphs ⋮ Regularity properties for triple systems ⋮ Hereditary properties of hypergraphs ⋮ Complete Partite subgraphs in dense hypergraphs

This page was built for publication: Hereditary Properties of Triple Systems