List coloring in general graphs
Name
1014342214-MIT.pdf
Description
Full printable version
Size
1.9 MB
Format
Adobe PDF
Checksum (MD5)
6cc690a66ac256c6453fd1e99a6a4ee2
Author(s)
Sengupta, Rik
Advisor(s)
Michel X. Goemans.
Date Issued
2015
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis we explore some of the relatively new approaches to the problem of list-coloring graphs. This is a problem that has its roots in classical graph theory, but has developed an entire theory of its own, that uses tools from structural graph theory, probabilistic approaches, as well as heuristic and algorithmic approaches. This thesis details two approaches one can take to understand list-coloring and prove results for several classes of graphs; one of them is to use the idea of graph kernels, and the other is to look at list-edge-coloring. In this thesis we present the state-of-the-art research on these two problems. We begin by setting up definitions and preliminaries, and then go into each of these two topics in turn. Along the way we briefly mention some of the very new research on the topics, including some new approaches developed for the purpose of writing this thesis. We finish with a survey of some of the major open problems that still remain in the area.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Mathematics, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 30-31).
Subjects
Mathematics.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
Persistent DSpace Link
