2 papers
math.CO2024
Creating Subgraphs in Semi-Random Hypergraph Games
Natalie Behague, Pawel Pralat, Andrzej Rucinski
The semi-random hypergraph process is a natural generalisation of the semi-random graph process, which can be thought of as a one player game. For fixed , starting with an e…
math.CO2023
Sharper analysis of the random graph -process via a balls-in-bins model
Andrzej Rucinski, Nick Wormald
A graph -process starts with an empty graph on vertices, and adds one edge at each time step, chosen uniformly at random from those pairs which are not yet edges and whose b…