<?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:00:52Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3715" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3715</identifier><datestamp>2017-03-21T16:35:00Z</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="author" authority="ddc57e75-1e04-4bad-9369-f3cc91a4cd82" confidence="600">Pei, Martin</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-05-21T18:44:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-05-21T18:44:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-05-21T18:44:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2008</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3715</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We study several extremal problems in graphs and hypergraphs.  The first one is on list-colouring hypergraphs, which is a generalization of the ordinary colouring of hypergraphs.  We discuss two methods for determining the list-chromatic number of hypergraphs.  One method uses hypergraph polynomials, which invokes Alon&amp;apos;s combinatorial nullstellensatz.  This method usually requires computer power to complete the calculations needed for even a modest-sized hypergraph.  The other method is elementary, and uses the idea of minimum improper colourings.  We apply these methods to various classes of hypergraphs, including the projective planes.&#xd;
&#xd;
We focus on solving the list-colouring problem for Steiner triple systems (STS).  It is not hard using either method to determine that Steiner triple systems of orders 7, 9 and 13 are 3-list-chromatic.  For systems of order 15, we show that they are 4-list-colourable, but they are also ``almost&amp;apos;&amp;apos; 3-list-colourable.  For all Steiner triple systems, we prove a couple of simple upper bounds on their list-chromatic numbers. Also, unlike ordinary colouring where a 3-chromatic STS exists for each admissible order, we prove using probabilistic methods that for every $s$, every STS of high enough order is not $s$-list-colourable.&#xd;
&#xd;
The second problem is on embedding nearly-spanning bounded-degree trees in sparse graphs.  We determine sufficient conditions based on expansion properties for a sparse graph to embed every nearly-spanning tree of bounded degree.  We then apply this to random graphs, addressing a question of Alon, Krivelevich and Sudakov, and determine a probability $p$ where the random graph $G_{n,p}$ asymptotically almost surely contains every tree of bounded degree.  This $p$ is nearly optimal in terms of the maximum degree of the trees that we embed.&#xd;
&#xd;
Finally, we solve a problem that arises from quantum computing, which can be formulated as an extremal question about maximizing the size of a type of acyclic directed graph.</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">graphs</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">hypergraphs</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">extremal graph theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">list colouring</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">tree embedding</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">List colouring hypergraphs and extremal results for acyclic graphs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">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" lang="en">Doctor of Philosophy</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>