Abstract: Let be a collection of -uniform hypergraphs, and let . It is known that there exists such that the probability of a random -graph in not containing an induced subgraph from is . Let each graph in have at least vertices. We show that in fact for every , there exists such that the probability of a random -graph in containing less than induced subgraphs each lying in is at most . This statement is an analogue for hereditary properties of the supersaturation theorem of ErdH{o}s and Simonovits. In our applications we answer a question of Bollob'as and Nikiforov.
Recommendations
Cites work
- scientific article; zbMATH DE number 3825706 (Why is no real title available?)
- scientific article; zbMATH DE number 3557819 (Why is no real title available?)
- Excluding Induced Subgraphs III: A General Asymptotic
- Hereditary properties of hypergraphs
- On a packing and covering problem
- On the entropy values of hereditary classes of graphs
- Projections of Bodies and Hereditary Properties of Hypergraphs
- Supersaturated graphs and hypergraphs
- The number of graphs with large forbidden subgraphs
- The structure of hereditary properties and 2-coloured multigraphs
- The structure of hereditary properties and colourings of random graphs
Cited in
(3)
This page was built for publication: Supersaturation for hereditary properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412233)