Back to search

McMaster University

Graphs and Ultrapowers

Abstract

dc:description.abstract

<p> Graphs are defined as a special kind of relational system and an analogue of Birkhoff's Representation Theorem for Universal Algebras is proved. The notion of ultrapower, a specialization of the ultraproducts introduced into Mathematical Logic by Tarski, Scott and others, is demonstrated to provide a unifying framework within which various problems of graph theory and infinite combinatorial mathematics can be formulated and solved. Thus, theorems extending to the infinite case results 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). </p>

Degree

thesis:*
Department dc:contributor.department
Mathematics
Year dc:date.issued
1969

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Fawcett, Barry Ward
Advisor dc:contributor.advisor
  • Sabidussi, G.O.

Subjects

dc:subject × 1

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Fawcett, Barry Ward. Graphs and Ultrapowers. 1969. http://hdl.handle.net/11375/17747