Codex Wiki
OurBigBook.com
Site
Source code
Quadratic Turan edge bound
...
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Extremal graph theory
Turan theorem
OurBigBook.com
Words: 9
Every
n
-vertex graph containing no
K
r
+
1
satisfies
e
(
G
)
≤
(
1
−
r
1
)
2
n
2
.
(48)
Ancestors
(7)
Turan theorem
Extremal graph theory
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution