PreprintCC BY-NC-SA 4.0arXiv
Turán numbers for suspensions of bipartite 2-regular graphs
Abstract
For a graph R, let R̂:=K1+R denote its suspension, obtained by adding a new vertex adjacent to every vertex of R. For every fixed nonempty bipartite $2$-regular graph R, we determine ex(n,R̂) for all sufficiently large n and characterize all extremal graphs. Three distinct cases arise, according as R is 2C6, a disjoint union of copies of C4, or neither of these. This extends the known exact Turá results on odd wheels to suspensions of arbitrary bipartite 2-regular graphs.
Related
BibTeX
@misc{wu2026turán,
title = {{Turán numbers for suspensions of bipartite 2-regular graphs}},
author = {Haoxing Wu and Junxue Zhang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.39445},
eprint = {2610.39445},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.39445},
note = {CC BY-NC-SA 4.0},
}
RIS
TY - UNPB
TI - Turán numbers for suspensions of bipartite 2-regular graphs
AU - Haoxing Wu
AU - Junxue Zhang
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.39445
UR - https://arxiv.org/abs/2610.39445
AB - For a graph R, let R̂:=K_1+R denote its suspension, obtained by adding a new vertex adjacent to every vertex of R. For every fixed nonempty bipartite $2$-regular graph R, we determine ex(n,R̂) for all sufficiently large n and characterize all extremal graphs. Three distinct cases arise, according as R is 2C_6, a disjoint union of copies of C_4, or neither of these. This extends the known exact Turá results on odd wheels to suspensions of arbitrary bipartite 2-regular graphs.
ER -