OurBigBook About$ Donate
 Sign in Sign up

Quadratic Turan edge bound

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Extremal graph theory Turan theorem
Created 2026-09-24 Updated 2026-09-29  0 By others on same topic  0 Discussions Create my own version
Every n-vertex graph containing no Kr+1​ satisfies
e(G)≤(1−r1​)2n2​.
(1)

 Ancestors (7)

  1. Turan theorem
  2. Extremal graph theory
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 3 / 17H / a / 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