THE TURÁN NUMBER OF SPANNING STAR FORESTS

Lin Peng Zhang; Ligong Wang; Jiale Zhou

doi:10.7151/dmgt.2368

THE TURÁN NUMBER OF SPANNING STAR FORESTS

Lin Peng Zhang, Ligong Wang, Jiale Zhou

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

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

1 Scopus citations

Abstract

Let F be a family of graphs. The Turán number of F, denoted by ex(n, F), is the maximum number of edges in a graph with n vertices which does not contain any subgraph isomorphic to some graph in F. A star forest is a forest whose connected components are all stars and isolated vertices. Motivated by the results of Wang, Yang and Ning about the spanning Turán number of linear forests [J. Wang and W. Yang, The Turán number for spanning linear forests, Discrete Appl. Math. 254 (2019) 291–294; B. Ning and J. Wang, The formula for Turán number of spanning linear forests, Discrete Math. 343 (2020) #111924]. In this paper, let S_n,k be the set of all star forests with n vertices and k edges.

Original language	English
Pages (from-to)	303-312
Number of pages	10
Journal	Discussiones Mathematicae - Graph Theory
Volume	43
Issue number	2
DOIs	https://doi.org/10.7151/dmgt.2368
State	Published - 2023

Keywords

Loebl-Komlós-Sós type problems
spanning Turán problem
star forests

Access to Document

10.7151/dmgt.2368

Cite this

@article{9835c5be2d9b4a918fff1607d744d625,

title = "THE TUR{\'A}N NUMBER OF SPANNING STAR FORESTS",

abstract = "Let F be a family of graphs. The Tur{\'a}n number of F, denoted by ex(n, F), is the maximum number of edges in a graph with n vertices which does not contain any subgraph isomorphic to some graph in F. A star forest is a forest whose connected components are all stars and isolated vertices. Motivated by the results of Wang, Yang and Ning about the spanning Tur{\'a}n number of linear forests [J. Wang and W. Yang, The Tur{\'a}n number for spanning linear forests, Discrete Appl. Math. 254 (2019) 291–294; B. Ning and J. Wang, The formula for Tur{\'a}n number of spanning linear forests, Discrete Math. 343 (2020) #111924]. In this paper, let Sn,k be the set of all star forests with n vertices and k edges.",

keywords = "Loebl-Koml{\'o}s-S{\'o}s type problems, spanning Tur{\'a}n problem, star forests",

author = "Zhang, {Lin Peng} and Ligong Wang and Jiale Zhou",

year = "2023",

doi = "10.7151/dmgt.2368",

language = "英语",

volume = "43",

pages = "303--312",

journal = "Discussiones Mathematicae - Graph Theory",

issn = "1234-3099",

publisher = "University of Zielona Gora",

number = "2",

}

TY - JOUR

T1 - THE TURÁN NUMBER OF SPANNING STAR FORESTS

AU - Zhang, Lin Peng

AU - Wang, Ligong

AU - Zhou, Jiale

PY - 2023

Y1 - 2023

N2 - Let F be a family of graphs. The Turán number of F, denoted by ex(n, F), is the maximum number of edges in a graph with n vertices which does not contain any subgraph isomorphic to some graph in F. A star forest is a forest whose connected components are all stars and isolated vertices. Motivated by the results of Wang, Yang and Ning about the spanning Turán number of linear forests [J. Wang and W. Yang, The Turán number for spanning linear forests, Discrete Appl. Math. 254 (2019) 291–294; B. Ning and J. Wang, The formula for Turán number of spanning linear forests, Discrete Math. 343 (2020) #111924]. In this paper, let Sn,k be the set of all star forests with n vertices and k edges.

AB - Let F be a family of graphs. The Turán number of F, denoted by ex(n, F), is the maximum number of edges in a graph with n vertices which does not contain any subgraph isomorphic to some graph in F. A star forest is a forest whose connected components are all stars and isolated vertices. Motivated by the results of Wang, Yang and Ning about the spanning Turán number of linear forests [J. Wang and W. Yang, The Turán number for spanning linear forests, Discrete Appl. Math. 254 (2019) 291–294; B. Ning and J. Wang, The formula for Turán number of spanning linear forests, Discrete Math. 343 (2020) #111924]. In this paper, let Sn,k be the set of all star forests with n vertices and k edges.

KW - Loebl-Komlós-Sós type problems

KW - spanning Turán problem

KW - star forests

UR - http://www.scopus.com/inward/record.url?scp=85115909228&partnerID=8YFLogxK

U2 - 10.7151/dmgt.2368

DO - 10.7151/dmgt.2368

M3 - 文章

AN - SCOPUS:85115909228

SN - 1234-3099

VL - 43

SP - 303

EP - 312

JO - Discussiones Mathematicae - Graph Theory

JF - Discussiones Mathematicae - Graph Theory

IS - 2

ER -

THE TURÁN NUMBER OF SPANNING STAR FORESTS

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this