1 citations · 2 across the 14 of their papers we have counts for
4 papers · 2 filters
Exact Turán numbers of two vertex-disjoint paths
Miao Dong, Bo Ning, Long-Tu Yuan +1
The Turán number of a graph is the maximum number of edges in any graph of order that does not contain as a subgraph. In 1959, Erd\H os and Gallai obtained a sharp uppe…
Two conjectures on vertex-disjoint rainbow triangles
Xu Liu, Bo Ning, Yuting Tian
In 1963, Dirac proved that every -vertex graph has vertex-disjoint triangles if and minimum degree . The base case can be reduced t…
A new spectral Turán theorem for weighted graphs and consequences
Lele Liu, Bo Ning
Confirming a conjecture of Elphick and Edwards and strengthening a spectral theorem of Wilf, Nikiforov proved that for any -free graph , , wh…
The stability of independence polynomials of complete bipartite graphs
Guo Chen, Bo Ning, Jianhua Tu
The independence polynomial of a graph is termed {\it stable} if all its roots are located in the left half-plane , and the graph itse…