Ping Hu

activity

20112026

most citedUpper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

58 citations · 211 across the 14 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

math.CO2013

Mantel's Theorem for Random Hypergraphs

József Balogh, Jane Butterfield, Ping Hu +1

A classical result in extremal graph theory is Mantel's Theorem, which states that every maximum triangle-free subgraph of $K_{n}$ is bipartite. A sparse version of Mantel's Theorem…

math.CO2013★ 2 cited

Phase transitions in the Ramsey-Turán theory

József Balogh, Ping Hu, Miklós Simonovits

Let $f (n)$ be a function and $L$ be a graph. Denote by $R T (n, L, f (n))$ the maximum number of edges of an $L$ -free graph on $n$ vertices with independence number less than $f (n)$ . Er…