3 papers
math.CO2025
Optimally building spanning graphs in semirandom graph processes
Michael Anastos, Maurício Collares, Joshua Erde +3
The semirandom graph process constructs a graph in a series of rounds, starting with the empty graph on vertices. In each round, a player is offered a vertex chosen uni…
math.CO2024
Bootstrap percolation on the high-dimensional Hamming graph
Mihyun Kang, Michael Missethan, Dominik Schmid
In the random -neighbour bootstrap percolation process on a graph , a set of initially infected vertices is chosen at random by retaining each vertex of independently wit…
math.CO2023
Catching a robber on a random -uniform hypergraph
Joshua Erde, Mihyun Kang, Florian Lehner +2
The game of \emph{Cops and Robber} is usually played on a graph, where a group of cops attempt to catch a robber moving along the edges of the graph. The \emph{cop number} of a gra…