Ping Hu

most citedThe inducibility of oriented stars

4 citations · 4 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

On degree powers in the degenerate Turán problem

Ping Hu, Ting Lan, Henry Liu

Given a graph $G$ with degree sequence $d_{1}, \dots, d_{n}$ and a positive real number $p$ , let $e_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . For a fixed family of graphs $F$ , let…

math.CO2026

On the Turán number of double stars

Ping Hu, Ting Lan

The Turán number of a graph $F$ , $e x (n, F)$ , is the maximum number of edges in a graph on $n$ vertices which does not contain $F$ as a subgraph. Let $S_{a, b}$ denote a double star w…

math.CO2020★ 4 cited

The inducibility of oriented stars

Ping Hu, Jie Ma, Sergey Norin +1

We consider the problem of maximizing the number of induced copies of an oriented star $S_{k, ℓ}$ in digraphs of given size, where the center of the star has out-degree $k$ and i…