Show simple item record

dc.contributor.advisorMichel X. Goemans.en_US
dc.contributor.authorSengupta, Riken_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Mathematics.en_US
dc.date.accessioned2017-12-20T18:15:48Z
dc.date.available2017-12-20T18:15:48Z
dc.date.copyright2015en_US
dc.date.issued2015en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/112878
dc.descriptionThesis: S.M., Massachusetts Institute of Technology, Department of Mathematics, 2015.en_US
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 30-31).en_US
dc.description.abstractIn 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.en_US
dc.description.statementofresponsibilityby Rik Sengupta.en_US
dc.format.extent31 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT 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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectMathematics.en_US
dc.titleList coloring in general graphsen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics.en_US
dc.identifier.oclc1014342214en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record