Home
Generalized Turan's graph theorem
Authors: Nikolay Khadzhiivanov, Nedyalko Nenov
Let $G$ be an $n$-vertex graph and there is a vertex of $G$ which is contained in maximum number of $p$-cliques, but is not contained in $(s+1)$-clique, where ${2\le p\le\min(s,n)}$. Then the number of $p$-cliques of $G$ is less than the number of $p$-cliques in the $n$-vertex $S$-partite Tur\'an's graph $T_s(n)$ or $G=T_s(n)$.
Annotation in PDF format:
(PDF document
30Kb)
(PDF document
30Kb)
Keywords: complete s-partite graph, Turan's graph
2000 MSC:
05C35
