A note on Turán's theorem

Long Tu Yuan

doi:10.1016/j.amc.2019.05.020

A note on Turán's theorem

Long Tu Yuan

University of Science and Technology of China

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English
Pages (from-to)	13-14
Number of pages	2
Journal	Applied Mathematics and Computation
Volume	361
DOIs	https://doi.org/10.1016/j.amc.2019.05.020
State	Published - 15 Nov 2019
Externally published	Yes

Keywords

Clique
Co-connected graph
Turán's theorem

Access to Document

10.1016/j.amc.2019.05.020

Cite this

@article{9a4abb32c1a14f7da50091da18b6a3c6,

title = "A note on Tur{\'a}n's theorem",

abstract = "Tur{\'a}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{\'a}n's theorem.",

keywords = "Clique, Co-connected graph, Tur{\'a}n's theorem",

author = "Yuan, \{Long Tu\}",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier Inc.",

year = "2019",

month = nov,

day = "15",

doi = "10.1016/j.amc.2019.05.020",

language = "英语",

volume = "361",

pages = "13--14",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - A note on Turán's theorem

AU - Yuan, Long Tu

PY - 2019/11/15

Y1 - 2019/11/15

N2 - 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.

AB - 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.

KW - Clique

KW - Co-connected graph

KW - Turán's theorem

UR - https://www.scopus.com/pages/publications/85066068685

U2 - 10.1016/j.amc.2019.05.020

DO - 10.1016/j.amc.2019.05.020

M3 - 文章

AN - SCOPUS:85066068685

SN - 0096-3003

VL - 361

SP - 13

EP - 14

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

ER -

A note on Turán's theorem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this