<?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:51:21Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/2680" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/2680</identifier><datestamp>2017-03-21T19:55:02Z</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="e32df9b6-a17d-4f11-89fd-7e4bb4c0c190" confidence="600">Pivotto, Irene</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-01-22T21:03:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-01-22T21:03:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-01-22T21:03:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2006</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/2680</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In this thesis we will present two main theorems that can be used to study&#xd;
minor minimal non even cut matroids. &#xd;
Given any signed graph we can associate an even cut matroid. However, given&#xd;
an even cut matroid, there are in general, several signed graphs which&#xd;
represent that matroid. This is in contrast to, for instance graphic (or&#xd;
cographic) matroids, where all graphs corresponding to a particular&#xd;
graphic matroid are essentially equivalent. To tackle the multiple&#xd;
non equivalent representations of even cut matroids we use the concept of&#xd;
Stabilizer first introduced by Wittle. Namely, we show the following:&#xd;
given a &amp;quot;substantial&amp;quot; signed graph, which represents a matroid N that is a&#xd;
minor of a matroid M, then if the signed graph extends to a signed graph&#xd;
which represents M then it does so uniquely. Thus the representations of the&#xd;
small matroid determine the representations of the larger matroid containing&#xd;
it. This allows us to consider each representation of an even cut matroid&#xd;
essentially independently.&#xd;
&#xd;
Consider a small even cut matroid N that is a minor of a matroid M that is&#xd;
not an even cut matroid. We would like to prove that there exists a&#xd;
matroid N&amp;apos; which contains N and is contained in M such that the size of N&amp;apos;&#xd;
is small and such that N&amp;apos; is not an even cut matroid (this would imply in&#xd;
particular that there are only finitely many minimally non even cut&#xd;
matroids containing N). Clearly, none of the representations of N extends to&#xd;
M. We will show that (under certain technical conditions) starting from a&#xd;
fixed representation of N, there exists a matroid N&amp;apos; which contains N&#xd;
and is contained in M such that the size of N&amp;apos; is small and such that the&#xd;
representation of N does not extend to N&amp;apos;.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">582923 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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">even cut matroid</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">On Excluded Minors for Even Cut Matroids</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master 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">Master of Mathematics</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>