Bo Ning

activity

20232026

most citedVariants of spectral Turán theorems and eigenvectors of graphs

1 citations · 2 across the 14 of their papers we have counts for

collaborators

Showing 2024Show all

4 papers · 1 filter

math.CO2024★ 1 cited

The number of edges in graphs with bounded clique number and circumference

Chunyang Dou, Bo Ning, Xing Peng

Let $H$ be a family of graphs. The Turán number $ex (n, H)$ is the maximum possible number of edges in an $n$ -vertex graph which does not contain any member of $\ca…

math.CO2024

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs

Changchang Dong, Mei Lu, Jixiang Meng +1

Given a graph $T$ and a family of graphs $F$ , the maximum number of copies of $T$ in an $F$ -free graph on $n$ vertices is called the generalized Turán number, d…

math.CO2024

On degree power sum in $P_{k}$ -free graphs

Jiangdong Ai, Fankang He, Yihang Liu +1

Let $G$ be a graph on $n$ vertices with degree sequence $(d_{1}, d_{2} ...... d_{n})$ . For a real $p \geq 1$ , let $D_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . A Turán-type problem of degree power sum was in…

math.CO2024

Graph operations and a unified method for kinds of Turán-type problems on paths, cycles and matchings

Jiangdong Ai, Hui Lei, Bo Ning +1

Let $G$ be a connected graph and $P (G)$ a graph parameter. We say that $P (G)$ is feasible if $P (G)$ satisfies the following properties: (I) $\mathcal{…

The number of edges in graphs with bounded clique number and circumference

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs

On degree power sum in Pk​-free graphs

Graph operations and a unified method for kinds of Turán-type problems on paths, cycles and matchings

On degree power sum in $P_{k}$ -free graphs