1 citations · 2 across the 5 of their papers we have counts for
5 papers
A generalised transference principle
Peter Allen, Julia Böttcher, Joanna Lada +1
The last two decades have witnessed a growing trend towards proving sparse random analogues of combinatorial theorems. One unified approach to proving such theorems, formalised by…
Spanning tight components in 4-uniform hypergraphs
Francesco Di Braccio, Brian Hearn, Joanna Lada +2
We prove that every -vertex 4-uniform hypergraph with minimum codegree at least has a spanning tight component. This is tight, and it settles the 4-uniform…
Hamilton decompositions of regular tripartite tournaments
Francesco Di Braccio, Joanna Lada, Viresh Patel +2
Kühn and Osthus conjectured in 2013 that regular tripartite tournaments are decomposable into Hamilton cycles. Somewhat surprisingly, Granet gave a simple counterexample to this co…
Long running times for hypergraph bootstrap percolation
Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg +1
Consider the hypergraph bootstrap percolation process in which, given a fixed -uniform hypergraph and starting with a given hypergraph , at each step we add to al…
A note on colour-bias Hamilton cycles in dense graphs
Andrea Freschi, Joseph Hyde, Joanna Lada +1
Balogh, Csaba, Jing and Pluhár recently determined the minimum degree threshold that ensures a -coloured graph contains a Hamilton cycle of significant colour bias (i.e., a…