Turán numbers for suspensions of bipartite 2-regular graphs

For a graph $R$, let $\widehat 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 $\operatorname{ex}(n,\widehat{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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.39445
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Turán numbers for suspensions of bipartite 2-regular graphs

Junxue Zhang, Haoxing Wu
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

Turán numbers for suspensions of bipartite 2-regular graphs

Junxue Zhang, Haoxing Wu
preprint en

Abstract

For a graph $R$, let $\widehat 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 $\operatorname{ex}(n,\widehat{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.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon