3 citations · 7 across the 18 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Upper bounds on the running time of bootstrap percolation
Weichan Liu, Xiangxiang Nie, Simón Piga +1
For -graphs and the -bootstrap percolation process (or -process) starting with is a sequence of -graphs such that is obtained…
math.CO2026
Hamiltonicity of inhomogeneous random graphs
Frederik Garbe, Jan Hladký, Simón Piga
We provide a complete characterization of those graphons for which the inhomogeneous random graph \(\G(n,W)\) is asymptotically almost surely Hamiltonian. The characterization…