Simple Containers for Simple Hypergraphs

DOI10.1017/S096354831500022XzbMath1372.05151arXiv1402.5400OpenAlexW3101625811MaRDI QIDQ5366900

David Saxton, Andrew G. Thomason

Publication date: 10 October 2017

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

Full work available at URL: https://arxiv.org/abs/1402.5400

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items

Online containers for hypergraphs, with applications to linear equations, Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers], Extremal problems in hypergraph colourings, A short nonalgorithmic proof of the containers theorem for hypergraphs, Hypergraph containers, On the structure of oriented graphs and digraphs with forbidden tournaments or cycles, List colorings of multipartite hypergraphs, An efficient container lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Hypergraph containers
• The structure of hereditary properties and 2-coloured multigraphs
• Supersaturated graphs and hypergraphs
• Hereditary properties of hypergraphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On \(K^ 4\)-free subgraphs of random graphs
• List Colourings of Regular Hypergraphs
• Excluding Induced Subgraphs III: A General Asymptotic
• Turán's theorem in sparse random graphs
• The Turn Theorem for Random Graphs
• Independent sets in hypergraphs
• The structure of hereditary properties and colourings of random graphs