activity
20232025
most citedBuilding Hamiltonian Cycles in the Semi-Random Graph Process in Less Than Rounds

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

math.CO2024

Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model

Michael Molloy, Pawel Pralat, Gregory B. Sorkin

We study the 2-offer semirandom 3-uniform hypergraph model on vertices. At each step, we are presented with 2 uniformly random vertices. We choose any other vertex, thus creati…