Supersaturation for hereditary properties

From MaRDI portal
(Redirected from Publication:412233)




Abstract: Let mathcalF be a collection of r-uniform hypergraphs, and let 0<p<1. It is known that there exists c=c(p,mathcalF) such that the probability of a random r-graph in G(n,p) not containing an induced subgraph from mathcalF is 2(c+o(1))nchooser. Let each graph in mathcalF have at least t vertices. We show that in fact for every epsilon>0, there exists delta=delta(epsilon,p,mathcalF)>0 such that the probability of a random r-graph in G(n,p) containing less than deltant induced subgraphs each lying in mathcalF is at most 2(c+epsilon)nchooser. 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.









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)