A note on Turán’s theorem

Long-Tu Yuan

Applied Mathematics and Computation, 2019, vol. 361, issue C, 13-14

Abstract: 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.

Keywords: Turán’s theorem; Co-connected graph; Clique (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319304138
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:361:y:2019:i:c:p:13-14

DOI: 10.1016/j.amc.2019.05.020

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().