A note on Turán’s theorem

作者：

Highlights：

•

摘要

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.

论文关键词：Turán’s theorem,Co-connected graph,Clique

论文评审过程：Received 29 October 2018, Revised 24 December 2018, Accepted 13 May 2019, Available online 27 May 2019, Version of Record 27 May 2019.

论文官网地址：https://doi.org/10.1016/j.amc.2019.05.020