Supersaturation for hereditary properties

Details Supersaturation for hereditary properties Supersaturation for hereditary properties

2011-04-28

arxiv.org/abs/1104.5401v1

Mathematics

Combinatorics

5 pages, submitted to European Journal of Combinatorics

Scientific paper

Let $\mathcal{F}$ be a collection of $r$-uniform hypergraphs, and let $0 < p < 1$. It is known that there exists $c = c(p,\mathcal{F})$ such that the probability of a random $r$-graph in $G(n,p)$ not containing an induced subgraph from $\mathcal{F}$ is $2^{(-c+o(1)){n \choose r}}$. Let each graph in $\mathcal{F}$ have at least $t$ vertices. We show that in fact for every $\epsilon > 0$, there exists $\delta = \delta (\epsilon, p,\mathcal{F}) > 0$ such that the probability of a random $r$-graph in $G(n,p)$ containing less than $\delta n^t$ induced subgraphs each lying in $\mathcal{F}$ is at most $2^{(-c+\epsilon){n \choose r}}$. This statement is an analogue for hereditary properties of the supersaturation theorem of Erd\H{o}s and Simonovits. In our applications we answer a question of Bollob\'as and Nikiforov.

Affiliated with

Also associated with

No associations

Rating

Supersaturation for hereditary properties does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Supersaturation for hereditary properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Supersaturation for hereditary properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-450035