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 2018Show all

3 papers · 1 filter

math.CO2018★ 18 cited

The formula for Turán number of spanning linear forests

Bo Ning, Jian Wang

Let $F$ be a family of graphs. The Turán number $e x (n; F)$ is defined to be the maximum number of edges in a graph of order $n$ that is $F$ -free. In 19…

math.CO2018

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations

Fengming Dong, Jun Ge, Helin Gong +3

The chromatic polynomial $P (G, x)$ of a graph $G$ of order $n$ can be expressed as $i = 1 \sum n (- 1)^{n - i} a_{i} x^{i}$ , where $a_{i}$ is interpreted as the number of broken-cycle…

math.CO2018★ 29 cited

Extensions of Erdős-Gallai Theorem and Luo's Theorem with Applications

Bo Ning, Xing Peng

The famous Erdős-Gallai Theorem on the Turán number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2 m}{n}$ edges. In this not…