ON THE TURÁN NUMBER OF EDGE BLOW-UPS OF CLIQUES*

Jialei Song; Changhong Lu; Long Tu Yuan

doi:10.1137/23M1623240

ON THE TURÁN NUMBER OF EDGE BLOW-UPS OF CLIQUES*

Jialei Song, Changhong Lu, Long Tu Yuan

School of Mathematical Sciences

East China Normal University

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

Abstract

The p-blow-up of a given graph is obtained by replacing each edge by a clique of order p where the new vertices of the cliques are distinct. Liu and Yuan determined the extremal graphs for the 3-blow-ups of a triangle and the p-blow-ups of any complete graph with order at most p – 2, respectively. We determine the Turán number for the p-blow-ups of a complete graph with order at least p – 1, completing the study of the extremal graphs for p-blow-ups of complete graphs.

Original language	English
Pages (from-to)	2429-2446
Number of pages	18
Journal	SIAM Journal on Discrete Mathematics
Volume	38
Issue number	3
DOIs	https://doi.org/10.1137/23M1623240
State	Published - 2024

Keywords

Turán number
complete graph
edge blow-up

Access to Document

10.1137/23M1623240

Cite this

@article{8e9294f7e61e46d3b9aad252e08284bf,

title = "ON THE TUR{\'A}N NUMBER OF EDGE BLOW-UPS OF CLIQUES*",

abstract = "The p-blow-up of a given graph is obtained by replacing each edge by a clique of order p where the new vertices of the cliques are distinct. Liu and Yuan determined the extremal graphs for the 3-blow-ups of a triangle and the p-blow-ups of any complete graph with order at most p – 2, respectively. We determine the Tur{\'a}n number for the p-blow-ups of a complete graph with order at least p – 1, completing the study of the extremal graphs for p-blow-ups of complete graphs.",

keywords = "Tur{\'a}n number, complete graph, edge blow-up",

author = "Jialei Song and Changhong Lu and Yuan, \{Long Tu\}",

note = "Publisher Copyright: {\textcopyright} 2024 Society for Industrial and Applied Mathematics.",

year = "2024",

doi = "10.1137/23M1623240",

language = "英语",

volume = "38",

pages = "2429--2446",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "3",

}

TY - JOUR

T1 - ON THE TURÁN NUMBER OF EDGE BLOW-UPS OF CLIQUES*

AU - Song, Jialei

AU - Lu, Changhong

AU - Yuan, Long Tu

PY - 2024

Y1 - 2024

N2 - The p-blow-up of a given graph is obtained by replacing each edge by a clique of order p where the new vertices of the cliques are distinct. Liu and Yuan determined the extremal graphs for the 3-blow-ups of a triangle and the p-blow-ups of any complete graph with order at most p – 2, respectively. We determine the Turán number for the p-blow-ups of a complete graph with order at least p – 1, completing the study of the extremal graphs for p-blow-ups of complete graphs.

AB - The p-blow-up of a given graph is obtained by replacing each edge by a clique of order p where the new vertices of the cliques are distinct. Liu and Yuan determined the extremal graphs for the 3-blow-ups of a triangle and the p-blow-ups of any complete graph with order at most p – 2, respectively. We determine the Turán number for the p-blow-ups of a complete graph with order at least p – 1, completing the study of the extremal graphs for p-blow-ups of complete graphs.

KW - Turán number

KW - complete graph

KW - edge blow-up

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

U2 - 10.1137/23M1623240

DO - 10.1137/23M1623240

M3 - 文章

AN - SCOPUS:85204308632

SN - 0895-4801

VL - 38

SP - 2429

EP - 2446

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 3

ER -

ON THE TURÁN NUMBER OF EDGE BLOW-UPS OF CLIQUES*

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this