Yandong Bai
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
Yandong Bai has a total of 25 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
10 shared publications - Binlong Li
School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an, People’s Republic of China
7 shared publications - Daniel A. Quiroz
Instituto de Ingeniería Matemática-CIMFAV Universidad de Valparaíso Valparaíso Chile
2 shared publications - Jiuqiang Liu
Department of Mathematics Eastern Michigan University Ypsilanti 48197 MI USA
2 shared publications - Pedro P. Cortés
Departamento de Ingeniería Matemática Universidad de Chile Santiago Chile
2 shared publications - Reza Naserasr
Université Paris Cité, CNRS, IRIF Paris France
2 shared publications
Latest Publications
- 20 August 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 394, 269-271
Agreeing families
- 20 August 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 394, 269-271
Agreeing families
- Open Access
Cross-intersecting families with covering number constraints
Two families $\mathcal{F}$ and $\mathcal{G}$ are cross-intersecting if every set in $\mathcal{F}$ intersects every set in $\mathcal{G}$. The covering number $τ(\mathcal{F})$ of a family $\mathcal{F}$ is the minimum size of a set that intersects every member of $\mathcal{F}$. In 1992, Frankl and Tokushige determined the maximum of $|\mathcal{F}| + |\mathcal{G}|$ for cross-intersecting families $\mathcal{F} \subset \binom{[n]}{a}$ and $\mathcal{G} \subset \binom{[n]}{b}$ that are non-empty (covering number at least 1) and also characterized the extremal configurations. This seminar result was recently extended by Frankl (2024) and Frankl and Wang (2025) to cases where both families are non-trivial (covering number at least 2), and where one is non-empty and the other non-trivial, respectively. In this paper, we establish a unified stability hierarchy for cross-intersecting families under general covering number constraints. We determine the maximum of $|\mathcal{F}| + |\mathcal{G}|$ for cross-intersecting families $\mathcal{F} \subset \binom{[n]}{a}$ and $\mathcal{G} \subset \binom{[n]}{b}$ with the following covering number constraints: (1) $τ(\mathcal{F}) \geq s$ and $τ(\mathcal{G}) \geq t$; (2) $τ(\mathcal{F}) = s$ and $τ(\mathcal{G}) \geq t \geq 2$; (3) $τ(\mathcal{F}) \geq s$ and $τ(\mathcal{G}) = t$; (4) $τ(\mathcal{F}) = s$ and $τ(\mathcal{G}) = t$; provided $a \geq b + t - 1$ and $n \geq \max\{a + b, bt\}$. The corresponding extremal families achieving the upper bounds are also characterized.Open AccessCross-intersecting families with covering number constraints
Two families $\mathcal{F}$ and $\mathcal{G}$ are cross-intersecting if every set in $\mathcal{F}$ intersects every set in $\mathcal{G}$. The covering number $τ(\mathcal{F})$ of a family $\mathcal{F}$ is the minimum size of a set that intersects every member of $\mathcal{F}$. In 1992, Frankl and Tokushige determined the maximum of $|\mathcal{F}| + |\mathcal{G}|$ for cross-intersecting families $\mathcal{F} \subset \binom{[n]}{a}$ and $\mathcal{G} \subset \binom{[n]}{b}$ that are non-empty (covering number at least 1) and also characterized the extremal configurations. This seminar result was recently extended by Frankl (2024) and Frankl and Wang (2025) to cases where both families are non-trivial (covering number at least 2), and where one is non-empty and the other non-trivial, respectively. In this paper, we establish a unified stability hierarchy for cross-intersecting families under general covering number constraints. We determine the maximum of $|\mathcal{F}| + |\mathcal{G}|$ for cross-intersecting families $\mathcal{F} \subset \binom{[n]}{a}$ and $\mathcal{G} \subset \binom{[n]}{b}$ with the following covering number constraints: (1) $τ(\mathcal{F}) \geq s$ and $τ(\mathcal{G}) \geq t$; (2) $τ(\mathcal{F}) = s$ and $τ(\mathcal{G}) \geq t \geq 2$; (3) $τ(\mathcal{F}) \geq s$ and $τ(\mathcal{G}) = t$; (4) $τ(\mathcal{F}) = s$ and $τ(\mathcal{G}) = t$; provided $a \geq b + t - 1$ and $n \geq \max\{a + b, bt\}$. The corresponding extremal families achieving the upper bounds are also characterized. - 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$. - 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$. - Open Access
Vertex-disjoint cycles of different lengths in tournaments
Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles,here $k$ is a positive integer. Lichiardopol conjectured in 2014 that for every positive integer $k$ there exists an integer $g(k)$ such that every digraph with minimum outdegree at least $g(k)$ contains $k$ vertex-disjoint cycles of different lengths. Recently, Chen and Chang proved in [J. Graph Theory 105 (2) (2024) 297-314] that for $k\geqslant 3$ every tournament with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles in which two of them have different lengths. Motivated by the above two conjectures and related results, we investigate vertex-disjoint cycles of different lengths in tournaments, and show that when $k\geqslant 5$ every tournament with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles in which three of them have different lengths. In addition, we show that every tournament with minimum outdegree at least $6$ contains three vertex-disjoint cycles of different lengths and the minimum outdegree condition is sharp. This answers a question proposed by Chen and Chang.Open AccessVertex-disjoint cycles of different lengths in tournaments
Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles,here $k$ is a positive integer. Lichiardopol conjectured in 2014 that for every positive integer $k$ there exists an integer $g(k)$ such that every digraph with minimum outdegree at least $g(k)$ contains $k$ vertex-disjoint cycles of different lengths. Recently, Chen and Chang proved in [J. Graph Theory 105 (2) (2024) 297-314] that for $k\geqslant 3$ every tournament with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles in which two of them have different lengths. Motivated by the above two conjectures and related results, we investigate vertex-disjoint cycles of different lengths in tournaments, and show that when $k\geqslant 5$ every tournament with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles in which three of them have different lengths. In addition, we show that every tournament with minimum outdegree at least $6$ contains three vertex-disjoint cycles of different lengths and the minimum outdegree condition is sharp. This answers a question proposed by Chen and Chang. - Open Access
Characterizing and recognizing exact-distance squares of graphs
For a graph $G=(V,E)$, its exact-distance square, $G^{[\sharp 2]}$, is the graph with vertex set $V$ and with an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance (exactly) $2$ in $G$. The graph $G$ is an exact-distance square root of $G^{[\sharp 2]}$. We give a characterization of graphs having an exact-distance square root, our characterization easily leading to a polynomial-time recognition algorithm. We show that it is NP-complete to recognize graphs with a bipartite exact-distance square root. These two results strongly contrast known results on (usual) graph squares. We then characterize graphs having a tree as an exact-distance square root, and from this obtain a polynomial-time recognition algorithm for these graphs. Finally, we show that, unlike for usual square roots, a graph might have (arbitrarily many) non-isomorphic exact-distance square roots which are trees.Open AccessCharacterizing and recognizing exact-distance squares of graphs
For a graph $G=(V,E)$, its exact-distance square, $G^{[\sharp 2]}$, is the graph with vertex set $V$ and with an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance (exactly) $2$ in $G$. The graph $G$ is an exact-distance square root of $G^{[\sharp 2]}$. We give a characterization of graphs having an exact-distance square root, our characterization easily leading to a polynomial-time recognition algorithm. We show that it is NP-complete to recognize graphs with a bipartite exact-distance square root. These two results strongly contrast known results on (usual) graph squares. We then characterize graphs having a tree as an exact-distance square root, and from this obtain a polynomial-time recognition algorithm for these graphs. Finally, we show that, unlike for usual square roots, a graph might have (arbitrarily many) non-isomorphic exact-distance square roots which are trees. - 15 June 2023
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 39 (6) , 1153-1170
Uniform Hypergraphs under Certain Intersection Constraints between Hyperedges
- 15 June 2023
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 39 (6) , 1153-1170
Uniform Hypergraphs under Certain Intersection Constraints between Hyperedges
- 5 March 2023
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 45 (2) , 1-20
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
- 5 March 2023
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 45 (2) , 1-20
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
- Open Access
Characterizing and recognizing exact-distance squares of graphs
For a graph G = (V, E), its exact-distance square, G [♯2] , is the graph with vertex set V and with an edge between vertices x and y if and only if x and y have distance (exactly) 2 in G. The graph G is an exact-distance square root of G [♯2]. We give a characterization of graphs having an exact-distance square root, our characterization easily leading to a polynomial-time recognition algorithm. We show that it is NP-complete to recognize graphs with a bipartite exact-distance square root. These two results strongly contrast known results on (usual) graph squares. We then characterize graphs having a tree as an exact-distance square root, and from this obtain a polynomial-time recognition algorithm for these graphs. Finally, we show that, unlike for usual square roots, a graph might have (arbitrarily many) non-isomorphic exactdistance square roots which are trees.
Open AccessCharacterizing and recognizing exact-distance squares of graphs
For a graph G = (V, E), its exact-distance square, G [♯2] , is the graph with vertex set V and with an edge between vertices x and y if and only if x and y have distance (exactly) 2 in G. The graph G is an exact-distance square root of G [♯2]. We give a characterization of graphs having an exact-distance square root, our characterization easily leading to a polynomial-time recognition algorithm. We show that it is NP-complete to recognize graphs with a bipartite exact-distance square root. These two results strongly contrast known results on (usual) graph squares. We then characterize graphs having a tree as an exact-distance square root, and from this obtain a polynomial-time recognition algorithm for these graphs. Finally, we show that, unlike for usual square roots, a graph might have (arbitrarily many) non-isomorphic exactdistance square roots which are trees.
- 13 September 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (1)
Connected k-factors in bipartite graphs
- 13 September 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (1)
Connected k-factors in bipartite graphs