| dc.contributor.author | Levit, Maxwell | |
| dc.date.accessioned | 2018-04-30 20:16:04 (GMT) | |
| dc.date.available | 2018-04-30 20:16:04 (GMT) | |
| dc.date.issued | 2018-04-30 | |
| dc.date.submitted | 2018-04-24 | |
| dc.identifier.uri | http://hdl.handle.net/10012/13211 | |
| dc.description.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. | en |
| dc.language.iso | en | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | Graph Coloring | en |
| dc.subject | List Coloring | en |
| dc.subject | Galvin's Theorem | en |
| dc.title | Extensions of Galvin's Theorem | en |
| dc.type | Master Thesis | en |
| dc.pending | false | |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws-etd.degree.discipline | Combinatorics and Optimization | en |
| uws-etd.degree.grantor | University of Waterloo | en |
| uws-etd.degree | Master of Mathematics | en |
| uws.contributor.advisor | Cheriyan, Joseph | |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.published.city | Waterloo | en |
| uws.published.country | Canada | en |
| uws.published.province | Ontario | en |
| uws.typeOfResource | Text | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
