| Title | GENERALIZED TURAN’S GRAPH THEOREM |
| Publication Type | Journal Article |
| Year of Publication | 2004 |
| Authors | Khadzhiivanov N, Nenov N |
| Journal | Annuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique |
| Volume | 96 |
| Keywords | complete s-partite graph, Turan's graph |
| Abstract | 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)$. |
| 2000 MSC | 05C35 |
| Attachment | Size |
|---|---|
 0696.pdf | 30.2 KB |
| Attachment | Size |
|---|---|
| 96-069-073.pdf | 372.07 KB |