Restricted extension of sparse partial edge colorings of complete graphs
Combinatorics
2019-12-17 v1
Abstract
Given a partial edge coloring of a complete graph and lists of allowed colors for the non-colored edges of , can we extend the partial edge coloring to a proper edge coloring of using only colors from the lists? We prove that this question has a positive answer in the case when both the partial edge coloring and the color lists satisfy certain sparsity conditions.
Cite
@article{arxiv.1912.07393,
title = {Restricted extension of sparse partial edge colorings of complete graphs},
author = {Carl Johan Casselgren and Lan Anh Pham},
journal= {arXiv preprint arXiv:1912.07393},
year = {2019}
}