194 citations · 2.2k across the 69 of their papers we have counts for
4 papers · 1 filter
Almost all trees are almost graceful
Anna Adamaszek, Peter Allen, Codrut Grosu +1
The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that t…
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…
Matching polytons
Martin Dolezal, Jan Hladky
Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding noti…
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.…