Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.12826

On the Turán number of odd-ballooning of $3$-chromatic graphs

Longfei Fang·Xueyi Huang·Huiqiu Lin·Jinlong Shu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a graph $F$, the Turán number ${\rm ex}(n,F)$ is the maximum number of edges in any $n$-vertex $F$-free graph. The odd-ballooning of $F$, denoted by $F^{o}$, is a graph obtained by replacing each edge of $F$ with an odd cycle, where all new vertices of the odd cycles are distinct. The Turán number of the odd-ballooning of $F$ has been established for several important cases. For a star, it was determined by Erdős, Füredi, Gould, and Gunderson (1995), Hou, Qiu, and Liu (2018), and Yuan (2018); for trees under certain conditions, by Zhu and Chen (2023); and for complete bipartite graphs $K_{s,t}$ ($t\geq s \geq 2$) where each substituted odd cycle has length at least five, by Peng and Xia (2024). In this paper, we apply Simonovits' celebrated method of progressive induction to determine the Turán number for the odd-ballooning of a class of $3$-chromatic graphs. Specifically, let $F$ be a graph formed by connecting a single vertex to all vertices of another graph whose components are either non-trivial trees or even cycles. We determine ${\rm ex}(n,F^{o})$ when each substituted odd cycle in $F^{o}$ has length at least five. As corollaries, we obtain the Turán number for the odd-ballooning of several well-known graph classes, including odd wheels, fan graphs, book graphs, and friendship graphs, where each substituted odd cycle in the ballooning has length at least five.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Longfei Fang, Xueyi Huang, Huiqiu Lin, Jinlong Shu. 2026-06-02. On the Turán number of odd-ballooning of $3$-chromatic graphs. https://arxiv.org/abs/2508.12826

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Orbital Bivariate Chromatic Polynomial

We introduce the \emph{orbital bivariate chromatic polynomial}, which counts generalized vertex colorings of a graph up to the action of a group of symmetries. More precisely, adjacent vertices must either receive distinct colors from a set of $λ$ colors or may receive the same color from a distinguished subset of $λ-μ$ colors. This new graph polynomial simultaneously generalizes the orbital chromatic polynomial due to Cameron and Kayibi (2007) and bivariate chromatic polynomial due to Dohmen, Pönitz, and Tittmann (2003). We establish fundamental structural properties and derive explicit formulas for several graph families, including complete graphs, complete bipartite graphs, paths, cycles, and wheels. In particular, several of these results are new even in the special case of the orbital chromatic polynomial. For cycles, our results generalize Moreau's necklace polynomial and lead to a new generalization and proof of Fermat's Little Theorem.

math.CO↗
arXiv2026

Morse theory and moduli spaces of simple polylines and polygons

We prove that a smooth $d$-manifold $M$ is diffeomorphic to $\mathbb R^d$ if it admits a Lyapunov-Reeb function, i.e., a smooth map $f\colon M\to\mathbb R$ that is proper, lower-bounded, and possesses exactly one critical point. We further establish that the moduli spaces of simple polylines and positively oriented polygons with fixed or varying side lengths are diffeomorphic to Euclidean spaces, by explicitly constructing Lyapunov-Reeb functions on these spaces. This yields a refined resolution to the Carpenter's Rule Problem and settles a conjecture proposed by González and Sedano-Mendoza. In addition, we describe foliation structures of the moduli spaces and develop algorithms for the refolding problem.

math.CO↗
arXiv2026

An edge-spectral Erdős-Stone-Simonovits theorem and its stability

We study the extremal problem that relates the spectral radius $λ(G)$ of an $F$-free graph $G$ to its number of edges. Firstly, we prove that for any graph $F$ with chromatic number $χ(F)=r+1\ge 3$, if $G$ is an $F$-free graph with $m$ edges, then $λ^2(G)\le {(1-\frac{1}{r} + o(1))2m}$. This provides a unified extension of both the Erdős-Stone-Simonovits theorem and its vertex-spectral extension due to Nikiforov, and confirms a conjecture proposed by Li, Liu and Feng. We also establish the corresponding edge-spectral stability, showing that if $G$ is an $F$-free graph with $m$ edges with $λ^2(G) \ge (1- \frac{1}{r} - o(1))2m$, then $G$ differs from a complete bipartite graph by $o(m)$ edges when $r=2$, and $G$ differs from an $r$-partite Turán graph by $o(m)$ edges when $r\ge 3$. This extends both the classical Erdős-Simonovits stability and the Nikiforov vertex-spectral stability. This edge-spectral stability theorem is the key ingredient in our companion work on the Brualdi-Hoffman-Turán problem for color-critical forbidden graphs. As an application of our method, we improve a result of Zhai, Lin and Shu by showing that if $λ(G)>\sqrt{m}$, then there exist two vertices in $G$ that have at least $\frac{1}{2}\sqrt{m} - O(1)$ common neighbors. The constant $\frac{1}{2}$ is best possible as witnessed by a random construction.

math.CO↗