22 citations · 112 across the 37 of their papers we have counts for
3 papers · 1 filter
An elementary proof of the bunkbed conjecture for forests
Serte Donderwinkel, Joost Jorritsma, Guillem Perarnau
Although false for general graphs, this note gives an elementary proof of the bunkbed conjecture for any acyclic graph. The argument is short and self-contained, and may be of educ…
An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
Lucas De Meyer, František Kardoš, Aurélie Lagoutte +1
The problem of sampling edge-colorings of graphs with maximum degree has received considerable attention and efficient algorithms are available when the number of colors is lar…
A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs
Amarja Kathapurkar, Patrick Morris, Guillem Perarnau
A meta-conjecture of Coulson, Keevash, Perarnau and Yepremyan states that above the extremal threshold for a given spanning structure in a (hyper-)graph, one can find a rainbow ver…