For the complete -uniform hypergraph , with , the bound is . In the complementary covering formulation, every -set containing an edge forces asymptotic edge density at least . It follows from clique-extension incidence inequalities and Cauchy-Schwarz inequality estimates on link degrees.
Articles by others on the same topic
There are currently no matching articles.