Simple containers for simple hypergraphs

DOI10.1017/S096354831500022XMaRDI QIDQ5366900zbMATH OpenOpenAlexFDO

Authors David Saxton, Andrew 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)

Abstract: We give an easy method for constructing containers for simple hypergraphs. Some applications are given; in particular, a very transparent calculation is offered for the number of H-free hypergraphs, where H is some fixed uniform hypergraph.

Recommendations

• Online containers for hypergraphs, with applications to linear equations
• Hypergraph containers
• The method of hypergraph containers
• Stochastic Algorithms: Foundations and Applications

Cites work

• Combinatorial theorems in sparse random sets
• Excluding Induced Subgraphs III: A General Asymptotic
• Extremal results for random discrete structures
• Hereditary properties of hypergraphs
• scientific article; zbMATH DE number 5130822 (Why is no real title available?)
• scientific article; zbMATH DE number 3557819 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Hypergraph containers
• Independent sets in hypergraphs
• List colourings of regular hypergraphs
• On \(K^ 4\)-free subgraphs of random graphs
• Supersaturated graphs and hypergraphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The structure of hereditary properties and 2-coloured multigraphs
• The structure of hereditary properties and colourings of random graphs
• The Turn Theorem for Random Graphs
• Turán's theorem in sparse random graphs

Cited in

(13)

• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• Online containers for hypergraphs, with applications to linear equations
• A short nonalgorithmic proof of the containers theorem for hypergraphs
• Hypergraph containers
• Extremal problems in hypergraph colourings
• The method of hypergraph containers
• An efficient container lemma
• List colorings of multipartite hypergraphs
• Stochastic Algorithms: Foundations and Applications
• Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers
• The Typical Approximate Structure of Sets with Bounded Sumset
• Probabilistic hypergraph containers
• Short proof of the hypergraph container theorem

This page was built for publication: Simple containers for simple hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366900)