Fractional coloring with local demands
share
We investigate fractional colorings of graphs in which the amount of color given to a vertex depends on local parameters, such as its degree or the clique number of its neighborhood; in a fractional f-coloring, vertices are given color from the [0, 1]-interval and each vertex v receives at least f(v) color. By Linear Programming Duality, all of the problems we study have an equivalent formulation as a problem concerning weighted independence numbers. However, these problems are most natural in the framework of fractional coloring, and the concept of coloring is crucial to most of our proofs. Our results and conjectures considerably generalize many well-known fractional coloring results, such as the fractional relaxation of Reed's Conjecture, Brooks' Theorem, and Vizing's Theorem. Our results also imply previously unknown bounds on the independence number of graphs. We prove that if G is a graph and f(v) ≤ 1/(d(v) + 1/2) for each v∈ V(G), then either G has a fractional f-coloring or G contains a clique K such that ∑_v∈ Kf(v) > 1. This result generalizes the famous Caro-Wei Theorem, and it implies that every graph G with no simplicial vertex has an independent set of size at least ∑_v∈ V(G)1/d(v) + 1/2, which is tight for the 5-cycle.
READ FULL TEXT