58 citations · 211 across the 14 of their papers we have counts for
4 papers · 1 filter
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…