Browsing Mathematics (Faculty of) by Subject "post-positional semi-random graph process"
Now showing items 1-1 of 1
-
k-Connectedness and k-Factors in the Semi-Random Graph Process
(University of Waterloo, 2022-12-20)The semi-random graph process is a single-player graph game where the player is initially presented an edgeless graph with n vertices. In each round, the player is offered a vertex u uniformly at random and subsequently ...