Abstract:We study the following problem: given a real number k and integer d, what is the smallest ε such that any fractional (k +ε)-precoloring of vertices at pairwise distances at least d of a fractionally k-colorable graph can be extended to a fractional (k + ε)-coloring of the whole graph? The exact values of ε were known for k ∈ {2} ∪ [3, ∞) and any d. We determine the exact values of ε for k ∈ (2, 3) if d = 4, and k ∈ [2.5, 3) if d = 6, and give upper bounds for k ∈ (2, 3) if d = 5, 7, and k ∈ (2, 2.5) if d = 6. … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.