Tur' a n numbers for suspensions of bipartite 2-regular graphs
math.CO
Submitted: 2026-10-29
Updated: 2026-10-29
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: For a graph R, let R:=K 1+R denote its suspension, obtained by adding a new vertex adjacent to every vertex of R.
Abstract
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,) 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.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality