A compactness theorem for Hamilton circles in infinite graphs

Simple item page
dc.contributor.authorFunk, Daryl J.
dc.contributor.supervisorBrewster, Richard
dc.date.accessioned2009-04-28T17:36:35Z
dc.date.available2009-04-28T17:36:35Z
dc.date.copyright2009en
dc.date.issued2009-04-28T17:36:35Z
dc.degree.departmentDept. of Mathematics and Statisticsen
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractThe problem of defining cycles in infinite graphs has received much attention in the literature. Diestel and Kuhn have proposed viewing a graph as 1-complex, and defining a topology on the point set of the graph together with its ends. In this setting, a circle in the graph is a homeomorph of the unit circle S^1 in this topological space. For locally finite graphs this setting appears to be natural, as many classical theorems on cycles in finite graphs extend to the infinite setting. A Hamilton circle in a graph is a circle containing all the vertices of the graph. We exhibit a necessary and sufficient condition that a countable graph contain a Hamilton circle in terms of the existence of Hamilton cycles in an increasing sequence of finite graphs. As corollaries, we obtain extensions to locally finite graphs of Zhan's theorem that all 7-connected line graphs are hamiltonian (confirming a conjecture of Georgakopoulos), and Ryjacek's theorem that all 7-connected claw-free graphs are hamiltonian. A third corollary of our main result is Georgakopoulos' theorem that the square of every two-connected locally finite graph contains a Hamilton circle (an extension of Fleischner's theorem that the square of every two-connected finite graph is Hamiltonian).en
dc.identifier.urihttp://hdl.handle.net/1828/1369
dc.languageEnglisheng
dc.language.isoenen
dc.rightsAvailable to the World Wide Weben
dc.subjectGraph Theoryen
dc.subjectInfinite graphsen
dc.subjectTopological graph theoryen
dc.subjectHamiltonicityen
dc.subjectHamilton circleen
dc.subjectline graphen
dc.subjectclaw-free graphen
dc.subjectsquare graphen
dc.subject.lcshUVic Subject Index::Sciences and Engineering::Mathematics::Pure mathematicsen
dc.titleA compactness theorem for Hamilton circles in infinite graphsen
dc.typeThesisen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A compactness theorem for Hamilton circles in infinite graphs.pdf
Size:
518.19 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.82 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
Theses (Mathematics and Statistics)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.