Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/17747
Title: | Graphs and Ultrapowers |
Authors: | Fawcett, Barry Ward |
Advisor: | Sabidussi, G.O. |
Department: | Mathematics |
Keywords: | graphs, ultrapowers, logic, relational, system |
Publication Date: | Sep-1969 |
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> |
URI: | http://hdl.handle.net/11375/17747 |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fawcett_Barry_W._1969Sept_Ph.D..pdf | 1.33 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.