Binlong Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Binlong Li has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Shenggui Zhang
School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an, P. R. China
12 shared publications - Yandong Bai
School of Mathematics and Statistics Joint Research Center for Combinatorics Xi'an-Budapest Northwestern Polytechnical University Xi'an 710129 Shaanxi China
7 shared publications - Bo Ning
Nankai University
5 shared publications - Jiuqiang Liu
Department of Mathematics Eastern Michigan University Ypsilanti 48197 MI USA
2 shared publications - Wangyi Shang
School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an, People’s Republic of China
2 shared publications - Yufeng Pan
School of Mathematics and Statistics Northwestern Polytechnical University 710072 Xi'an Shaanxi P. R. China
2 shared publications
Latest Publications
- Open Access
Cycle lengths in graphs of given minimum degree
In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item [(1)] $G$ contains $k$ admissible cycles, unless $G\cong K_{k+1}$ or $K_{k,n-k}$; \item [(2)] $G$ contains cycles of lengths $\ell$ modulo $k$ for all even $\ell$, unless $G\cong K_{k+1}$ or $K_{k,n-k}$; \item [(3)] $G$ contains cycles of lengths $\ell$ modulo $k$ for all $\ell$, unless $G\cong K_{k+1}$ or $G$ is bipartite. \end{itemize} In addition, we show that if $k$ is even and $G$ is 2-connected with minimum degree at least $k-1$ and order at least $k+2$, then $G$ contains cycles of lengths $\ell$ modulo $k$ for all even $\ell$. These findings provide a stability analysis of the main results on cycle lengths in graphs of given minimum degree in [J. Gao, Q. Huo, C. Liu, J. Ma, A unified proof of conjectures on cycle lengths in graphs, International Mathematics Research Notices 2022 (10) (2022) 7615--7653]. As a corollary, we determine the maximum number of edges in a graph that does not contain a cycle of length 0 modulo $k$ for all odd $k$.Open AccessCycle lengths in graphs of given minimum degree
In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item [(1)] $G$ contains $k$ admissible cycles, unless $G\cong K_{k+1}$ or $K_{k,n-k}$; \item [(2)] $G$ contains cycles of lengths $\ell$ modulo $k$ for all even $\ell$, unless $G\cong K_{k+1}$ or $K_{k,n-k}$; \item [(3)] $G$ contains cycles of lengths $\ell$ modulo $k$ for all $\ell$, unless $G\cong K_{k+1}$ or $G$ is bipartite. \end{itemize} In addition, we show that if $k$ is even and $G$ is 2-connected with minimum degree at least $k-1$ and order at least $k+2$, then $G$ contains cycles of lengths $\ell$ modulo $k$ for all even $\ell$. These findings provide a stability analysis of the main results on cycle lengths in graphs of given minimum degree in [J. Gao, Q. Huo, C. Liu, J. Ma, A unified proof of conjectures on cycle lengths in graphs, International Mathematics Research Notices 2022 (10) (2022) 7615--7653]. As a corollary, we determine the maximum number of edges in a graph that does not contain a cycle of length 0 modulo $k$ for all odd $k$. - 28 September 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (5) , 1-4
An infinite version of prime circles
- 28 September 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (5) , 1-4
An infinite version of prime circles
- Open Access
Localized and weighted versions of extremal problems
Malec and Tompkins (EUJC, 2023) considered the localized versions of Turán-type problems, and proved a localized theorem on Erdős-Gallai Theorem on paths. Zhao and Zhang (JGT, 2025) gave a long proof of a localized version of Erdős-Gallai Theorem on cycles. In this paper, we consider several types of generalization of Turán-type problems, that is, localized versions, weighted versions, and generalized Turán-type problems, and their connectedness. We first present very short proofs for recent results of Malec-Tompkins and Zhao-Zhang, respectively. We use Small Path Double Cover Conjecture, which was proposed by Bondy (JGT, 1990) and confirmed by Hao Li (JGT, 1990), to prove a weighted localized Turán-type theorem on paths. We prove localized versions of Balister-Bollobás-Riordan-Schelp Theorem (JCTB, 2003) on paths and Erdős-Gallai Theorem on matchings, respectively. We show that our first localized result implies Balister-Bollobás- Riordan-Schelp Theorem, Erdős-Gallai Theorem, and Malec-Tompkins Theorem on paths. Finally, we present generalized Turán-style generalizations of the Malec-Tompkin's Theorem, and discuss the relationship between some previous theorems in different motivations.
Open AccessLocalized and weighted versions of extremal problems
Malec and Tompkins (EUJC, 2023) considered the localized versions of Turán-type problems, and proved a localized theorem on Erdős-Gallai Theorem on paths. Zhao and Zhang (JGT, 2025) gave a long proof of a localized version of Erdős-Gallai Theorem on cycles. In this paper, we consider several types of generalization of Turán-type problems, that is, localized versions, weighted versions, and generalized Turán-type problems, and their connectedness. We first present very short proofs for recent results of Malec-Tompkins and Zhao-Zhang, respectively. We use Small Path Double Cover Conjecture, which was proposed by Bondy (JGT, 1990) and confirmed by Hao Li (JGT, 1990), to prove a weighted localized Turán-type theorem on paths. We prove localized versions of Balister-Bollobás-Riordan-Schelp Theorem (JCTB, 2003) on paths and Erdős-Gallai Theorem on matchings, respectively. We show that our first localized result implies Balister-Bollobás- Riordan-Schelp Theorem, Erdős-Gallai Theorem, and Malec-Tompkins Theorem on paths. Finally, we present generalized Turán-style generalizations of the Malec-Tompkin's Theorem, and discuss the relationship between some previous theorems in different motivations.
- Open Access
A note on two cycles of consecutive even lengths in graphs
Bondy and Vince proved that a graph of minimum degree at least three contains two cycles whose lengths differ by one or two, which was conjectured by Erdős. Gao, Li, Ma and Xie gave an average degree counterpart of Bondy-Vince's result, stating that every $n$-vertex graph with at least $\frac{5}{2}(n-1)$ edges contains two cycles of consecutive even lengths, unless $4|(n-1)$ and every block of $G$ is a clique $K_5$. This confirms the case $k=2$ of Verstraëte's conjecture, which states that every $n$-vertex graph without $k$ cycles of consecutive even lengths has edge number $e(G)\leq\frac{1}{2}(2k+1)(n-1)$, with equality if and only if every block of $G$ is a clique of order $2k+1$. Sudakov and Verstraëte further conjectured that if $G$ is a graph with maximum number of edges that does not contain $k$ cycles of consecutive even lengths, then every block of $G$ is a clique of order at most $2k+1$. In this paper, we prove the case $k=2$ for Sudakov-Verstraëte's conjecture, by extending the results of Gao, Li, Ma and Xie.Open AccessA note on two cycles of consecutive even lengths in graphs
Bondy and Vince proved that a graph of minimum degree at least three contains two cycles whose lengths differ by one or two, which was conjectured by Erdős. Gao, Li, Ma and Xie gave an average degree counterpart of Bondy-Vince's result, stating that every $n$-vertex graph with at least $\frac{5}{2}(n-1)$ edges contains two cycles of consecutive even lengths, unless $4|(n-1)$ and every block of $G$ is a clique $K_5$. This confirms the case $k=2$ of Verstraëte's conjecture, which states that every $n$-vertex graph without $k$ cycles of consecutive even lengths has edge number $e(G)\leq\frac{1}{2}(2k+1)(n-1)$, with equality if and only if every block of $G$ is a clique of order $2k+1$. Sudakov and Verstraëte further conjectured that if $G$ is a graph with maximum number of edges that does not contain $k$ cycles of consecutive even lengths, then every block of $G$ is a clique of order at most $2k+1$. In this paper, we prove the case $k=2$ for Sudakov-Verstraëte's conjecture, by extending the results of Gao, Li, Ma and Xie. - 7 June 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 375, 25-37
Closures and heavy pairs for hamiltonicity
- 7 June 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 375, 25-37
Closures and heavy pairs for hamiltonicity
- 15 April 2025
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 41 (4) , 1181-1195
Turán Numbers for Vertex-disjoint Triangles and Pentagons
- 15 April 2025
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 41 (4) , 1181-1195
Turán Numbers for Vertex-disjoint Triangles and Pentagons
- Open Access
Characterizing forbidden pairs for spanning $\varTheta$-subgraphs of 2-connected graphs
Let $\mathcal{F}$ be a set of connected graphs, and let $G$ be a graph. We say that $G$ is \emph{$\mathcal{F}$-free} if it does not contain $F$ as an induced subgraph for all $F\in\mathcal{F}$, and we call $\mathcal{F}$ a forbidden pair if $|\mathcal{F}|=2$. A \emph{$\varTheta$-graph} is the graph consisting of three internally disjoint paths with the same pair of end-vertices. If the $\varTheta$-subgraph $T$ contains all vertices of $G$, then we call $T$ a \emph{spanning $\varTheta$-subgraph} of $G$. In this paper, we characterize all pairs of connected graphs $R,S$ such that every 2-connected $\{R,S\}$-free graph has a spanning $\varTheta$-subgraph. In order to obtain this result, we also characterize all minimal 2-connected non-cycle claw-free graphs without spanning $\varTheta$-subgraphs.Open AccessCharacterizing forbidden pairs for spanning $\varTheta$-subgraphs of 2-connected graphs
Let $\mathcal{F}$ be a set of connected graphs, and let $G$ be a graph. We say that $G$ is \emph{$\mathcal{F}$-free} if it does not contain $F$ as an induced subgraph for all $F\in\mathcal{F}$, and we call $\mathcal{F}$ a forbidden pair if $|\mathcal{F}|=2$. A \emph{$\varTheta$-graph} is the graph consisting of three internally disjoint paths with the same pair of end-vertices. If the $\varTheta$-subgraph $T$ contains all vertices of $G$, then we call $T$ a \emph{spanning $\varTheta$-subgraph} of $G$. In this paper, we characterize all pairs of connected graphs $R,S$ such that every 2-connected $\{R,S\}$-free graph has a spanning $\varTheta$-subgraph. In order to obtain this result, we also characterize all minimal 2-connected non-cycle claw-free graphs without spanning $\varTheta$-subgraphs. - Open Access
On graphs without cycles of length 1 modulo 3
Burr and Erdős conjectured in 1976 that for every two integers $k>\ell\geqslant 0$ satisfying that $k\mathbb{Z}+\ell$ contains an even integer, an $n$-vertex graph containing no cycles of length $\ell$ modulo $k$ can contain at most a linear number of edges on $n$. Bollobás confirmed this conjecture in 1977 and then Erdős proposed the problem of determining the exact value of the maximum number of edges in such a graph. For the above $k$ and $\ell$, define $c_{\ell,k}$ to be the least constant such that every $n$-vertex graph with at least $c_{\ell,k}\cdot n$ edges contains a cycle of length $\ell$ modulo $k$. The precise (or asymptotic) values of $c_{\ell,k}$ are known for very few pairs $\ell$ and $k$. In this paper, we precisely determine the maximum number of edges in a graph containing no cycles of length 1 modulo 3. In particular, we show that every $n$-vertex graph with at least $\frac{5}{3}(n-1)$ edges contains a cycle of length 1 modulo 3, unless $9|(n-1)$ and each block of the graph is a Petersen graph. As a corollary, we obtain that $c_{1,3}=\frac{5}{3}$. This is the last remaining class modulo $k$ for $1\leqslant k\leqslant 4$.Open AccessOn graphs without cycles of length 1 modulo 3
Burr and Erdős conjectured in 1976 that for every two integers $k>\ell\geqslant 0$ satisfying that $k\mathbb{Z}+\ell$ contains an even integer, an $n$-vertex graph containing no cycles of length $\ell$ modulo $k$ can contain at most a linear number of edges on $n$. Bollobás confirmed this conjecture in 1977 and then Erdős proposed the problem of determining the exact value of the maximum number of edges in such a graph. For the above $k$ and $\ell$, define $c_{\ell,k}$ to be the least constant such that every $n$-vertex graph with at least $c_{\ell,k}\cdot n$ edges contains a cycle of length $\ell$ modulo $k$. The precise (or asymptotic) values of $c_{\ell,k}$ are known for very few pairs $\ell$ and $k$. In this paper, we precisely determine the maximum number of edges in a graph containing no cycles of length 1 modulo 3. In particular, we show that every $n$-vertex graph with at least $\frac{5}{3}(n-1)$ edges contains a cycle of length 1 modulo 3, unless $9|(n-1)$ and each block of the graph is a Petersen graph. As a corollary, we obtain that $c_{1,3}=\frac{5}{3}$. This is the last remaining class modulo $k$ for $1\leqslant k\leqslant 4$. - 26 December 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (1) , 1-19
Local Degree Conditions for Hamiltonicity of Claw-Free Graphs
- 26 December 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (1) , 1-19
Local Degree Conditions for Hamiltonicity of Claw-Free Graphs
- Open Access
On graphs without cycles of length 0 modulo 4
Bollobás proved that for every $k$ and $\ell$ such that $k\mathbb{Z}+\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\ell \bmod k$ can contain at most a linear number of edges. The precise (or asymptotic) value of the maximum number of edges in such a graph is known for very few pairs $\ell$ and $k$. In this work we precisely determine the maximum number of edges in a graph containing no cycle of length $0 \bmod 4$.Open AccessOn graphs without cycles of length 0 modulo 4
Bollobás proved that for every $k$ and $\ell$ such that $k\mathbb{Z}+\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\ell \bmod k$ can contain at most a linear number of edges. The precise (or asymptotic) value of the maximum number of edges in such a graph is known for very few pairs $\ell$ and $k$. In this work we precisely determine the maximum number of edges in a graph containing no cycle of length $0 \bmod 4$.