OurBigBook About$ Donate
 Sign in Sign up

de Caen bound for hypergraph Turán density (π(Krℓ​)≤1−(ℓ−1r−1​)−1)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Hypergraph Extremal hypergraph theory Turán density
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For the complete ℓ-uniform hypergraph Krℓ​, with r≥ℓ≥2, the bound is π(Krℓ​)≤1−1/(ℓ−1r−1​). In the complementary covering formulation, every r-set containing an edge forces asymptotic edge density at least 1/(ℓ−1r−1​). It follows from clique-extension incidence inequalities and Cauchy-Schwarz inequality estimates on link degrees.

 Ancestors (8)

  1. Turán density
  2. Extremal hypergraph theory
  3. Hypergraph
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 110 / 5 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook