Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.18961

Odd and even cycle lengths, minimum degree and chromatic number in graphs

Xiaolin Wang·Meiduo Chen·Xueping Xu
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present the relations between clique number and chromatic number with given the number of odd or even or all cycle lengths. Let $L_o(G)$ be the set of odd cycle lengths of $G$ and $\ell_o(G)$ be the longest odd cycle length. Gyárfás (DM, 1992) proved a classic result: $χ(G)\leq 2|L_o(G)|+2$, and if $w(G)\leq 2|L_o(G)|+1$, then $χ(G)\leq 2|L_o(G)|+1$. Later, Wang (SIAM DM, 2008), Ma and Ning (SIAM DM, 2018) together determined the exact chromatic number when $|L_o(G)|=2$. We further prove that if $w(G)\leq 2|L_o(G)|$ for any $|L_o(G)|\geq 2$, then $χ(G)\leq 2|L_o(G)|$. We also construct a class of graphs with $w(G)=2|L_o(G)|-1$ but $χ(G)=2|L_o(G)|$ for every $|L_o(G)|\geq 2$. Using our result, we give a short proof of the relation between $w(G)$ and $χ(G)$ with given $\ell_o(G)$ proved by Kenkre and Vishwanathan (JGT, 2006). Let $L_e(G)$ be the set of even cycle lengths of $G$ and $\ell_e(G)$ be the longest even cycle length. Mihók and Schiermeyer (DM, 2004) proved that $χ(G)\leq 2|L_e(G)|+3$, and if $w(G)\leq 2|L_e(G)|+2$, then $χ(G)\leq 2|L_e(G)|+2$. We further prove that if $w(G)\leq 2|L_e(G)|+1$ and $|L_e(G)|\geq 3$, then $χ(G)\leq 2|L_e(G)|+1$. We also construct a class of graphs with $w(G)=2|L_e(G)|$ but $χ(G)=2|L_e(G)|+1$ for every $|L_e(G)|\geq 2$. Our result can deduce the relation between $w(G)$ and $χ(G)$ with given $\ell_e(G)$. Combining all the above results, we deduce the similar relations between $w(G)$ and $χ(G)$ with given the number of cycle lengths or the longest cycle length.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaolin Wang, Meiduo Chen, Xueping Xu. 2026-07-15. Odd and even cycle lengths, minimum degree and chromatic number in graphs. https://arxiv.org/abs/2511.18961

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

KEEP EXPLORING

Related papers

arXiv2026

Matching Complexes of Outerplanar Graphs

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres. This extends known results about trees and polygonal line tilings.

math.CO↗
arXiv2026

Awesome graph parameters

For a graph $G$, we denote by $α(G)$ the size of a maximum independent set and by $ω(G)$ the size of a maximum clique in $G$. Our paper lies on the edge of two lines of research, related to $α$ and $ω$, respectively. One of them studies $α$-variants of graph parameters, such as $α$-treewidth or $α$-degeneracy. The second line deals with graph classes where some parameters are bounded by a function of $ω(G)$. A famous example of this type is the family of $χ$-bounded classes, where the chromatic number $χ(G)$ is bounded by a function of $ω(G)$. A Ramsey-type argument implies that if the $α$-variant of a graph parameter $ρ$ is bounded by a constant in a hereditary class $\mathcal{G}$, then $ρ$ is bounded by a function of $ω$ in $\mathcal{G}$. If the reverse implication also holds, we say that $ρ$ is awesome. Otherwise, we say that $ρ$ is awful. In the present paper, we identify a number of awesome and awful graph parameters, derive some algorithmic applications of awesomeness, and propose a number of open problems related to these notions.

math.CO↗
arXiv2026

Perfect matchings and $A_α$-spectral radius in 1-binding graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $α\in[0,1)$, we use $A_α(G)$ and $ρ_α(G)$ to denote the $A_α$-matrix and the $A_α$-spectral radius of $G$, respectively. The binding number $\mbox{bind}(G)$ of $G$ is defined by $\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}$. If $\mbox{bind}(G)\geq1$, then $G$ is called 1-binding. A perfect matching in $G$ is a set of nonadjacent edges covering every vertex of $G$. Tutte proved that a graph $G$ of even order has a perfect matching if and only if $o(G-S)\leq|S|$ holds for every $S\subseteq V(G)$ [W. Tutte, The factorization of linear graphs, J. Lond. Math. Soc. 22 (1947) 107--111]. In this paper, we use Tutte's result to prove that a connected 1-binding graph $G$ of even order $n$ with $n\geq n(α)$ has a perfect matching unless $G=K_1\vee(K_{n-5}\cup K_3\cup K_1)$ if $ρ_α(G)\geqρ_α(K_1\vee(K_{n-5}\cup K_3\cup K_1))$, where $n(α)$ is defined as follows: $n(α)=\max\{18,\frac{2+8α}{1-2α}\}$ if $α\in[0,\frac{1}{2})$, and $n(α)=18$ if $α=\frac{1}{2}$.

math.CO↗