81 citations · 836 across the 70 of their papers we have counts for
5 papers · 2 filters
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
Padraig Condon, Alberto Espuny Díaz, Jaehoon Kim +2
Pósa's theorem states that any graph whose degree sequence satisfies for all has a Hamilton cycle. This degree condition is bes…
Euler tours in hypergraphs
Stefan Glock, Felix Joos, Daniela Kühn +1
We show that a quasirandom -uniform hypergraph has a tight Euler tour subject to the necessary condition that divides all vertex degrees. The case when is complete c…
Minimalist designs
Ben Barber, Stefan Glock, Daniela Kühn +3
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for c…
Rainbow structures in locally bounded colourings of graphs
Jaehoon Kim, Daniela Kühn, Andrey Kupavskii +1
We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a grap…
Edge correlations in random regular hypergraphs and applications to subgraph testing
Alberto Espuny Díaz, Felix Joos, Daniela Kühn +1
Compared to the classical binomial random (hyper)graph model, the study of random regular hypergraphs is made more challenging due to correlations between the occurrence of differe…