Extremal Graphs for Two Vertex-Disjoint Copies of a Clique

Wanfang Chen; Changhong Lu; Long Tu Yuan

doi:10.1007/s00373-022-02467-1

Extremal Graphs for Two Vertex-Disjoint Copies of a Clique

Wanfang Chen
, Changhong Lu
, Long Tu Yuan^*

^*Corresponding author for this work

School of Mathematical Sciences

East China Normal University

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

9 Scopus citations

Abstract

Applying a well-known result of Hajnal and Szemerédi, we determine the Turán number of two vertex-disjoint copies of a clique.

Original language	English
Article number	67
Journal	Graphs and Combinatorics
Volume	38
Issue number	3
DOIs	https://doi.org/10.1007/s00373-022-02467-1
State	Published - Jun 2022

Keywords

Clique
Extremal graph
Hajnal and Szemeréd theorem

Access to Document

10.1007/s00373-022-02467-1

Cite this

@article{dfd13d8cccdc431ca47a8acdc04bd15d,

title = "Extremal Graphs for Two Vertex-Disjoint Copies of a Clique",

abstract = "Applying a well-known result of Hajnal and Szemer{\'e}di, we determine the Tur{\'a}n number of two vertex-disjoint copies of a clique.",

keywords = "Clique, Extremal graph, Hajnal and Szemer{\'e}d theorem",

author = "Wanfang Chen and Changhong Lu and Yuan, \{Long Tu\}",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Japan KK, part of Springer Nature.",

year = "2022",

month = jun,

doi = "10.1007/s00373-022-02467-1",

language = "英语",

volume = "38",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "3",

}

TY - JOUR

T1 - Extremal Graphs for Two Vertex-Disjoint Copies of a Clique

AU - Chen, Wanfang

AU - Lu, Changhong

AU - Yuan, Long Tu

PY - 2022/6

Y1 - 2022/6

N2 - Applying a well-known result of Hajnal and Szemerédi, we determine the Turán number of two vertex-disjoint copies of a clique.

AB - Applying a well-known result of Hajnal and Szemerédi, we determine the Turán number of two vertex-disjoint copies of a clique.

KW - Clique

KW - Extremal graph

KW - Hajnal and Szemeréd theorem

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

U2 - 10.1007/s00373-022-02467-1

DO - 10.1007/s00373-022-02467-1

M3 - 文章

AN - SCOPUS:85126254480

SN - 0911-0119

VL - 38

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 3

M1 - 67

ER -

Extremal Graphs for Two Vertex-Disjoint Copies of a Clique

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this