25 citations · 31 across the 3 of their papers we have counts for
1 paper · 1 filter
Stefan Glock, Daniela Kühn, Deryk Osthus
Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let 0<p<1…