Bo Ning

activity

20112026

most citedEigenvalues and triangles in graphs

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

collaborators

Showing 2021Show all

6 papers · 1 filter

math.CO2021

Counting substructures and eigenvalues II: quadrilaterals

Bo Ning, Mingqing Zhai

Let $G$ be a graph and $λ (G)$ be the spectral radius of $G$ . A previous result due to Nikiforov [Linear Algebra Appl., 2009] in spectral graph theory asserted that every graph $G$ …

math.CO2021

Counting rainbow triangles in edge-colored graphs

Xueliang Li, Bo Ning, Yongtang Shi +1

Let $G$ be an edge-colored graph on $n$ vertices. The minimum color degree of $G$ , denoted by $δ^{c} (G)$ , is defined as the minimum number of colors assigned to the edges incident to…

math.CO2021★ 12 cited

Counting substructures and eigenvalues I: triangles

Bo Ning, Mingqing Zhai

Motivated by the counting results for color-critical subgraphs by Mubayi [Adv. Math., 2010], we study the phenomenon behind Mubayi's theorem from a spectral perspective and start u…

math.CO2021★ 15 cited

Eigenvalues and cycles of consecutive lengths

Binlong Li, Bo Ning

As the counterpart of classical theorems on cycles of consecutive lengths due to Bondy and Bollobás in spectral graph theory, Nikiforov proposed the following open problem in 2008:…

math.CO2021★ 3 cited

The stability method, eigenvalues and cycles of consecutive lengths

Binlong Li, Bo Ning

Woodall proved that for a graph $G$ of order $n \geq 2 k + 3$ where $k \geq 0$ is an integer, if $e (G) \geq (2 n - k - 1) + (2 k + 2) + 1$ then $G$ contains a $C_{ℓ}$ for each $\e…

math.CO2021

Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles

Binlong Li, Jie Ma, Bo Ning

For positive integers $n > d \geq k$ , let $ϕ (n, d, k)$ denote the least integer $ϕ$ such that every $n$ -vertex graph with at least $ϕ$ vertices of degree at least $d$ contains a path on…