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 2017 · math.COShow all

3 papers · 2 filters

math.CO2017★ 1 cited

An Ore-type Condition for Large $k$ -factor and Disjoint Perfect Matchings

Hongliang Lu, Bo Ning

Win [\emph{J. Graph Theory} {\bf 6}(1982), 489--492] conjectured that a graph $G$ on $n$ vertices contains $k$ disjoint perfect matchings, if the degree sum of any two nonadjacent…

math.CO2017★ 17 cited

Stability results on the circumference of a graph

Jie Ma, Bo Ning

In this paper, we extend and refine previous Turán-type results on graphs with a given circumference. Let $W_{n, k, c}$ be the graph obtained from a clique $K_{c - k + 1}$ by adding $n-(…

math.CO2017★ 19 cited

On sufficient conditions for rainbow cycles in edge-colored graphs

Shinya Fujita, Bo Ning, Chuandong Xu +1

Let $G$ be an edge-colored graph. We use $e (G)$ and $c (G)$ to denote the number of edges of $G$ and the number of colors appearing on $E (G)$ , respectively. For a vertex $v \in V (G)$ …

An Ore-type Condition for Large k-factor and Disjoint Perfect Matchings

Stability results on the circumference of a graph

On sufficient conditions for rainbow cycles in edge-colored graphs

An Ore-type Condition for Large $k$ -factor and Disjoint Perfect Matchings