<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T16:32:55Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/18976" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/18976</identifier><datestamp>2025-03-26T23:38:44Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Gao, Jane</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="8fc31526-c734-4f94-b97a-e51c6565af72" confidence="600">Koerts, Hidde</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-12-20T20:57:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-12-20T20:57:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-12-20</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2022-12-14</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/18976</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The semi-random graph process is a single-player graph game where the player is initially&#xd;
presented an edgeless graph with n vertices. In each round, the player is offered a vertex&#xd;
u uniformly at random and subsequently chooses a second vertex v deterministically ac-&#xd;
cording to some strategy, and adds edge uv to the graph. The objective for the player is&#xd;
then to ensure that the graph fulfils some specified property as fast as possible.&#xd;
&#xd;
We investigate the properties of being k-connected and containing a k-factor. We settle&#xd;
the open case for 2-connectedness by showing that the player has a strategy to construct a&#xd;
2-connected graph asymptotically almost surely in (ln 2+ln(ln 2+1)+o(1))n rounds, which&#xd;
matches a known lower bound asymptotically. We also provide a strategy for building a&#xd;
k-factor asymptotically almost surely in (β + 10^−5)n rounds, where β is derived from the&#xd;
solution of a system of differential equations.&#xd;
&#xd;
Additionally, we consider a variant that was recently suggested by Wormald where the&#xd;
player chooses the first vertex and the second vertex is chosen uniformly at random. We&#xd;
show that the bounds for k-connectedness for the traditional setting are also tight for this&#xd;
variant.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">semi-random graph process</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">k-factor</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">k-connectedness</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">random graph theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">pre-positional semi-random graph process</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">post-positional semi-random graph process</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">k-Connectedness and k-Factors in the Semi-Random Graph Process</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Gao, Jane</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>