58 citations · 211 across the 14 of their papers we have counts for
15 papers
On degree powers in the degenerate Turán problem
Ping Hu, Ting Lan, Henry Liu
Given a graph with degree sequence and a positive real number , let . For a fixed family of graphs , let…
On the Turán number of double stars
Ping Hu, Ting Lan
The Turán number of a graph , , is the maximum number of edges in a graph on vertices which does not contain as a subgraph. Let denote a double star w…
Clique-factors in graphs with sublinear -independence number
Jie Han, Ping Hu, Guanghui Wang +1
Given a graph and an integer , we denote by the maximum size of a -free subset of vertices in . A recent question of Nenadov and Pehova…
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 in digraphs of given size, where the center of the star has out-degree and i…
Densities of 3-vertex graphs
Roman Glebov, Andrzej Grzesik, Ping Hu +3
Let d_i(G) be the density of the 3-vertex i-edge graph in a graph G, i.e., the probability that three random vertices induce a subgraph with i edges. Let S be the set of all quadru…
Komlós's tiling theorem via graphon covers
Jan Hladký, Ping Hu, Diana Piguet
Komlos [Komlos: Tiling Turan Theorems, Combinatorica, 2000] determined the asymptotically optimal minimum-degree condition for covering a given proportion of vertices of a host gra…
Tilings in graphons
Jan Hladky, Ping Hu, Diana Piguet
We introduce a counterpart to the notion of vertex disjoint tilings by copy of a fixed graph F to the setting of graphons. The case F=K_2 gives the notion of matchings in graphons.…
Minimum number of edges that occur in odd cycles
Andrzej Grzesik, Ping Hu, Jan Volec
If a graph has vertices and more than edges, then it contains a copy of . In 1992, Erdős, Faudree and Rousseau showed even more, that the number of edges…
Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
József Balogh, Ping Hu, Bernard Lidický +1
Let denote the maximum number of induced copies of 5-cycles in graphs on vertices. For large enough, we show that $C(n)=a\cdot b\cdot c \cdot d \cdot e + C(a)+C(b)+C…
Minimum number of monotone subsequences of length 4 in permutations
József Balogh, Ping Hu, Bernard Lidický +3
We show that for every sufficiently large , the number of monotone subsequences of length four in a permutation on points is at least $\binom{\lfloor n/3 \rfloor}{4} + \bino…
Rainbow triangles in three-colored graphs
Jozsef Balogh, Ping Hu, Bernard Lidicky +3
Erdos and Sos proposed a problem of determining the maximum number F(n) of rainbow triangles in 3-edge-colored complete graphs on n vertices. They conjectured that F(n) = F(a)+ F(b…
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 is bipartite. A sparse version of Mantel's Theorem…
Phase transitions in the Ramsey-Turán theory
József Balogh, Ping Hu, Miklós Simonovits
Let be a function and be a graph. Denote by the maximum number of edges of an -free graph on vertices with independence number less than . Er…
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
József Balogh, Ping Hu, Bernard Lidický +1
In this paper we modify slightly Razborov's flag algebra machinery to be suitable for the hypercube. We use this modified method to show that the maximum number of edges of a 4-cyc…
On the Chromatic Thresholds of Hypergraphs
József Balogh, Jane Butterfield, Ping Hu +2
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-negative reals c such that the subfamily of F comprising hypergraphs H with minim…