A note on Turán’s theorem

Turán’s theorem is a cornerstone of the extremal graph theory. In this paper, we determine the minimum number of edges of a connected graph without containing an independent vertex set of a given size and give a new proof of Turán’s theorem.

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 361; pp. 13 - 14
Main Author Yuan, Long-Tu
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.11.2019
Subjects
Clique
Co-connected graph
Turán’s theorem
Turán’s theorem
Clique
Co-connected graph
05C35
Online AccessGet full text

Cover

More Information
Summary:Turán’s theorem is a cornerstone of the extremal graph theory. In this paper, we determine the minimum number of edges of a connected graph without containing an independent vertex set of a given size and give a new proof of Turán’s theorem.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2019.05.020