UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Extensions of Galvin's Theorem

Thumbnail Image

Files

Levit_Maxwell.pdf (569.33 KB)

Date

2018-04-30

Authors

Levit, Maxwell

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

We discuss problems in list coloring with an emphasis on techniques that utilize oriented graphs. Our central theme is Galvin's resolution of the Dinitz problem (Galvin. J. Comb. Theory, Ser. B 63(1), 1995, 153--158). We survey the related work of Alon and Tarsi (Combinatorica 12(2) 1992, 125--134) and H\"{a}ggkvist and Janssen (Combinatorics, Probability \& Computing 6(3) 1997, 295--313). We then prove two new extensions of Galvin's theorem.

Description

Keywords

Graph Coloring, List Coloring, Galvin's Theorem

LC Keywords

Citation

URI

http://hdl.handle.net/10012/13211

Collections

Theses
Combinatorics and Optimization