Gregory B. Sorkin

activity

20232025

collaborators

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 $G$ in a series of rounds, starting with the empty graph on $n$ vertices. In each round, a player is offered a vertex $v$ chosen uni…

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 $n$ vertices. At each step, we are presented with 2 uniformly random vertices. We choose any other vertex, thus creati…

math.CO2023

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2 n$ Rounds

Alan Frieze, Pu Gao, Calum MacRury +2

The semi-random graph process is an adaptive random graph process in which an online algorithm is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is…

Optimally building spanning graphs in semirandom graph processes

Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2 n$ Rounds