30 citations · 216 across the 23 of their papers we have counts for
23 papers
The asymptotic version of the Erdős-Sós conjecture and beyond
Akbar Davoodi, Diana Piguet, Hanka Řada +1
Klimošová, Piguet, and Rozhoň conjectured that any graph with minimum degree and sufficiently many vertices of degree should contain all trees with edges. We prove an…
The tree packing conjecture for trees of almost linear maximum degree
Peter Allen, Julia Böttcher, Dennis Clemens +3
We prove that there is such that for all sufficiently large , if are any trees such that has vertices and maximum degree at most , the…
A median-type condition for graph tiling
Diana Piguet, Maria Saumell
Komlos [Tiling Turan theorems, Combinatorica, 20,2 (2000), 203{218] determined the asymptotically optimal minimum degree condition for covering a given proportion of vertices of a…
Packing degenerate graphs
Peter Allen, Julia Böttcher, Jan Hladký +1
Given and , whenever is sufficiently small and sufficiently large, if is a family of -degenerate graphs of individual orders at most , maximu…
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.…