Bo Ning

activity

20112026

most citedEigenvalues and triangles in graphs

84 citations · 579 across the 67 of their papers we have counts for

collaborators

72 papers

math.CO2026

A near-linear Chvátal--Erdős condition for Hamilton cycles in digraphs

Chengli Li, Bo Ning

For a digraph $D$ , let $α_{2} (D)$ be the largest size of a vertex set containing no directed $2$ -cycle. Let $f_{2} (a)$ be the least positive integer $k$ such that every $k$ -strongly co…

math.CO2026

Longest cycles intersect linearly in highly connected graphs

Jie Ma, Bo Ning, Ziyuan Zhao

A longstanding conjecture attributed to Smith (1984) asserts that for every $k \geq 2$ , any two longest cycles in a $k$ -connected graph share at least $k$ vertices. In this paper, we…

math.CO2026

On Erdős Problem 767: Cycles with Chords

Xiaozheng Chen, Bo Ning

For integers $k \geq 1$ and $n \geq k + 2$ , let $g_{k} (n)$ be the maximum number of edges in an $n$ -vertex graph containing no cycle with a vertex incident with at least $k$ chords. Erdős…

math.CO2026

On the difference between clique partition and clique covering numbers of graphs

Bo Ning

For a graph $G$ , let $\cpn(G)$ and $\ccn(G)$ denote the minimum numbers of cliques whose edge sets partition and cover $E (G)$ , respectively, and put $f(n)=\max_{|V(G)|=n}\bigl(\cpn…

math.CO2026

Kohayakawa's conjecture and clique coverings of complements of paths and cycles

Bo Ning

For $s \geq 1$ , let $G_{s}$ be the bipartite graph between the $s$ -subsets and the $(s - 1)$ -subsets of $[2 s]$ , where adjacency means disjointness, and let $w (s)$ be the maximum number of…

math.CO2026

On the difference between clique partition and clique covering numbers

Bo Ning

For a graph $G$, let $\operatorname{cp}(G)$ and $\operatorname{cc}(G)$ be the minimum numbers of cliques in an edge partition and a clique cover of $G$, respectively. Set $…