A generalization of Turán's theorem

Domagoj Bradač

A generalization of Turán's theorem

Domagoj Bradač

Abstract

We prove a generalization of Turán's theorem proposed by Balogh and Lidický.

A generalization of Turán's theorem

Abstract

We prove a generalization of Turán's theorem proposed by Balogh and Lidický.

Paper Structure (1 theorem, 7 equations)

This paper contains 1 theorem, 7 equations.

Key Result

Theorem 1

Let $G$ be an arbitrary graph on $n$ vertices. For each edge $e \in E(G),$ define its weight $w(e)$ as $w(e) = \frac{r}{2(r-1)},$ where $r$ is the size of the largest clique in $G$ containing $e.$ Then,

Theorems & Definitions (2)

Theorem 1
proof : Proof of \ref{['thm:thm']}