Proof of a conjecture of Xiao and Zamora

Wanfang Chen; Changhong Lu; Jia Bao Yang; Long Tu Yuan

doi:10.1007/s00373-025-02972-z

Proof of a conjecture of Xiao and Zamora

Wanfang Chen
, Changhong Lu
, Jia Bao Yang
, Long Tu Yuan^*

^*此作品的通讯作者

数学科学学院

East China Normal University
Nanjing University

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

A wheel, defined by Tutte, is the graph obtained from a circle by adding one new vertex and joining this vertex to all vertices of the circle. We determine the maximum number of edges in a graph which does not contain vertex-disjoint wheels. This confirms a conjecture posed by Xiao and Zamora in a stronger form.

源语言	英语
文章编号	114
期刊	Graphs and Combinatorics
卷	41
期	6
DOI	https://doi.org/10.1007/s00373-025-02972-z
出版状态	已出版 - 12月 2025

访问文件

10.1007/s00373-025-02972-z

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{3ece79dbfad143fbad82e9fe23c82f3e,

title = "Proof of a conjecture of Xiao and Zamora",

abstract = "A wheel, defined by Tutte, is the graph obtained from a circle by adding one new vertex and joining this vertex to all vertices of the circle. We determine the maximum number of edges in a graph which does not contain vertex-disjoint wheels. This confirms a conjecture posed by Xiao and Zamora in a stronger form.",

keywords = "Erd{\H o}s-Simonovits stability theorem, Tur{\'a}n number, Wheels",

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

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

year = "2025",

month = dec,

doi = "10.1007/s00373-025-02972-z",

language = "英语",

volume = "41",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "6",

}

TY - JOUR

T1 - Proof of a conjecture of Xiao and Zamora

AU - Chen, Wanfang

AU - Lu, Changhong

AU - Yang, Jia Bao

AU - Yuan, Long Tu

N1 - Publisher Copyright: © The Author(s), under exclusive licence to Springer Nature Japan KK 2025.

PY - 2025/12

Y1 - 2025/12

N2 - A wheel, defined by Tutte, is the graph obtained from a circle by adding one new vertex and joining this vertex to all vertices of the circle. We determine the maximum number of edges in a graph which does not contain vertex-disjoint wheels. This confirms a conjecture posed by Xiao and Zamora in a stronger form.

AB - A wheel, defined by Tutte, is the graph obtained from a circle by adding one new vertex and joining this vertex to all vertices of the circle. We determine the maximum number of edges in a graph which does not contain vertex-disjoint wheels. This confirms a conjecture posed by Xiao and Zamora in a stronger form.

KW - Erdős-Simonovits stability theorem

KW - Turán number

KW - Wheels

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

U2 - 10.1007/s00373-025-02972-z

DO - 10.1007/s00373-025-02972-z

M3 - 文章

AN - SCOPUS:105018220593

SN - 0911-0119

VL - 41

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 6

M1 - 114

ER -

Proof of a conjecture of Xiao and Zamora

摘要

访问文件

其它文件与链接

指纹

引用此