<?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-21T04:53:31Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/17747" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/17747</identifier><datestamp>2026-09-24T06:57:24Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Sabidussi, G.O.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Fawcett, Barry Ward</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Mathematics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-07-15T17:14:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-07-15T17:14:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">1969-09</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/17747</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/14212</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">&lt;p> Graphs are defined as a special kind of relational system and an analogue&#xd;
of Birkhoff's Representation Theorem for Universal Algebras is proved. The notion&#xd;
of ultrapower, a specialization of the ultraproducts introduced into Mathematical&#xd;
Logic by Tarski, Scott and others, is demonstrated to provide a unifying framework within&#xd;
which various problems of graph theory and infinite combinatorial mathematics can&#xd;
be formulated and solved. Thus, theorems extending to the infinite case results&#xd;
of N.G.de Bruijn and P.Erdős in graph colouring, and of P. and M. Hall in combinatorial set theory are proved via the method of ultrapowers. Finally, the problem of embedding graphs in certain topological spaces is taken up, and a characterization of infinite connected planar graphs is derived (see Introduction). &lt;/p></dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">graphs, ultrapowers, logic, relational, system</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Graphs and Ultrapowers</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>