1 citations · 1 across the 5 of their papers we have counts for
5 papers
On -uniform tight cycles: the Ramsey number for and an approximate Lehel's conjecture
Vincent Pfenninger
A -uniform tight cycle is a -graph with a cyclic ordering of its vertices such that its edges are precisely the sets of consecutive vertices in that ordering. We show tha…
Almost partitioning every -edge-coloured complete -graph into monochromatic tight cycles
Allan Lo, Vincent Pfenninger
A -uniform tight cycle is a -graph with a cyclic order of its vertices such that every consecutive vertices from an edge. We show that for , every red-blue edge-…
The Ramsey number for 4-uniform tight cycles
Allan Lo, Vincent Pfenninger
A -uniform tight cycle is a -graph with a cyclic ordering of its vertices such that its edges are precisely the sets of consecutive vertices in that ordering. A -unifo…
Resilience for tight Hamiltonicity
Peter Allen, Olaf Parczyk, Vincent Pfenninger
We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any and , we show that asymptotically almost surely, every…
Towards Lehel's conjecture for 4-uniform tight cycles
Allan Lo, Vincent Pfenninger
A -uniform tight cycle is a -uniform hypergraph with a cyclic ordering of its vertices such that its edges are all the sets of size formed by consecutive vertices in…