Publication Date

5-2019

Advisor(s)

Karen L. Collins

Department

Mathematics

Abstract

The main focus of this paper is exploring precoloring extensions problems, specifically when the precolored subgraph consists of cliques. We explore this topic by providing more details to a proof by Michael O. Albertson in the paper ‘You Can’t Paint Yourself into a Corner’. Albertson shows that for a graph G with chromatic number r and P V (G), if P induces a set of cliques such that each clique is of order k ≤ r and whose pairwise distance is at least 6k − 2, then any proper (r + 1) - coloring of P can be extended to a proper (r + 1) - coloring of G. Before considering this theorem, we provide background on precoloring extensions, touch upon list-colorings and their relation to precoloring extensions, and discuss an important proof technique involving Kempe chains that we use throughout the paper. We also provide a result by Alexandr Kostochka, which is actually an improvement to Albertson’s result mentioned above. Kostochka’s result decreases the pairwise distance needed between cliques of order k to only 4k. We then provide Albertson and Moore’s more precise result concerning the distance needed between precolored cliques. Finally, building off of the arguments made in Kostochka’s proof, we prove that when the pairwise distance between cliques of order k is 2k + 2, any proper (r + 2) - coloring of P can be extended to a proper (r + 2 ) - coloring of G.

Share

COinS
 

© Copyright is owned by author of this document