The Turán number for the edge blow-up of trees: The missing case

Cheng Chi; Long Tu Yuan

doi:10.1016/j.disc.2023.113370

The Turán number for the edge blow-up of trees: The missing case

Cheng Chi
, Long Tu Yuan^*

^*Corresponding author for this work

School of Mathematical Sciences

East China Normal University

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

5 Scopus citations

Abstract

The edge blow-up of a graph is the graph obtained from replacing each edge of it by a clique of the same size where the new vertices of the cliques are all different. Wang, Hou, Liu and Ma determined the Turán number of the edge blow-up of trees except one particular case. Answering a problem posed by them, we determined the Turán number of this particular case.

Original language	English
Article number	113370
Journal	Discrete Mathematics
Volume	346
Issue number	6
DOIs	https://doi.org/10.1016/j.disc.2023.113370
State	Published - Jun 2023

Keywords

Edge blow-up
Extremal graphs
Trees

Access to Document

10.1016/j.disc.2023.113370

Cite this

@article{f3ea45e3be044e0bb86750dd2f600b59,

title = "The Tur{\'a}n number for the edge blow-up of trees: The missing case",

abstract = "The edge blow-up of a graph is the graph obtained from replacing each edge of it by a clique of the same size where the new vertices of the cliques are all different. Wang, Hou, Liu and Ma determined the Tur{\'a}n number of the edge blow-up of trees except one particular case. Answering a problem posed by them, we determined the Tur{\'a}n number of this particular case.",

keywords = "Edge blow-up, Extremal graphs, Trees",

author = "Cheng Chi and Yuan, \{Long Tu\}",

note = "Publisher Copyright: {\textcopyright} 2023 Elsevier B.V.",

year = "2023",

month = jun,

doi = "10.1016/j.disc.2023.113370",

language = "英语",

volume = "346",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - The Turán number for the edge blow-up of trees

T2 - The missing case

AU - Chi, Cheng

AU - Yuan, Long Tu

PY - 2023/6

Y1 - 2023/6

N2 - The edge blow-up of a graph is the graph obtained from replacing each edge of it by a clique of the same size where the new vertices of the cliques are all different. Wang, Hou, Liu and Ma determined the Turán number of the edge blow-up of trees except one particular case. Answering a problem posed by them, we determined the Turán number of this particular case.

AB - The edge blow-up of a graph is the graph obtained from replacing each edge of it by a clique of the same size where the new vertices of the cliques are all different. Wang, Hou, Liu and Ma determined the Turán number of the edge blow-up of trees except one particular case. Answering a problem posed by them, we determined the Turán number of this particular case.

KW - Edge blow-up

KW - Extremal graphs

KW - Trees

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

U2 - 10.1016/j.disc.2023.113370

DO - 10.1016/j.disc.2023.113370

M3 - 文章

AN - SCOPUS:85148011451

SN - 0012-365X

VL - 346

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 6

M1 - 113370

ER -

The Turán number for the edge blow-up of trees: The missing case

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this