<?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-22T20:09:17Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/23052" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/23052</identifier><datestamp>2026-04-24T19:28:58Z</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">Xing, Yun</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2026-04-24T19:28:58Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2026-04-24T19:28:58Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2026-04-24</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2026-04-22</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/10012/23052</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">In this thesis, we study several problems related to excluded structures in matroids and tournaments. For matroids, we focus on finding the excluded minors for pinch-graphic matroids. For tournaments, we bound the size of excluded induced subgraphs of k-degenerate tournaments and we bound the number of backedge graphs of a tournament that are P3-free or Kt-free. Furthermore, we introduce a new way to color the arcs of a tournament and we propose a conjecture that connects this coloring to tournaments that do not contain Paley tournaments as an induced subgraph.

For pinch-graphic matroids, we prove that if M is minimally non-pinch-graphic and M is not 3-connected, then |M| ≤ 20. Furthermore, we characterize all minimally non-pinch-graphic matroids that are not 3-connected. For the 3-connected case, we prove that in a special case, a 3-connected but not internally 4-connected minimally non-pinch-graphic matroid has at most 21 elements. We also improve a characterization of 3-separations in pinch-graphic matroids by Guenin and Heo.

For tournaments, we show that an excluded induced subgraph for 1-in(out)-degenerate tournaments has at most (k² + 5k + 6) / 2 vertices, and an excluded induced subgraph for 1-degenerate tournaments has at most k² + 5k + 6 vertices. We also prove that a tournament with n vertices can have at most exponentially many P3-free or Kt-free backedge graphs, despite there being n! backedge graphs for a tournament with n vertices. We then introduce a new way to arc-color a tournament T with the corresponding chromatic number denoted as χ_Δ(T). The rule is to arc-color a tournament such that every directed cycle of length 3 gets 3 distinct colors. We prove that for tournaments T with n vertices, the growth rate of χ_Δ(T) is Θ(log n).</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject">Graph Theory</dim:field>
   <dim:field mdschema="dc" element="subject">Matroid Theory</dim:field>
   <dim:field mdschema="dc" element="subject">Tournaments</dim:field>
   <dim:field mdschema="dc" element="subject">Pinch-graphic Matroids</dim:field>
   <dim:field mdschema="dc" element="subject">Excluded Induced Subgraphs</dim:field>
   <dim:field mdschema="dc" element="subject">Excluded Minors</dim:field>
   <dim:field mdschema="dc" element="title">Excluded Structures for Pinch-graphic Matroids and Tournaments</dim:field>
   <dim:field mdschema="dc" element="type">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline">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">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Guenin, Bertrand</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Spirkl, Sophie</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1">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>