For sufficiently large vertex count , normalized hypergraph extremal numbers decrease under vertex sampling and converge to Turán density. At a fixed sample size where the extremal density is close to that limit, excess density forces a positive fraction of samples to contain . Counting incidences of copies and samples proves the displayed lower bound. The unrounded positive lower bound is asserted for sufficiently large .
Articles by others on the same topic
There are currently no matching articles.