1 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2022★ 1 cited
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…
math.CO2020★ 1 cited
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…