Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Fractional coloring
Summary
Fractional coloring is a topic in a young branch of graph theory known as fractional graph theory. It is a generalization of ordinary graph coloring. In a traditional graph coloring, each vertex in a graph is assigned some color, and adjacent vertices — those connected by edges — must be assigned different colors. In a fractional coloring however, a set of colors is assigned to each vertex of a graph. The requirement about adjacent vertices still holds, so if two vertices are joined by an edge, they must have no colors in common.
Fractional graph coloring can be viewed as the linear programming relaxation of traditional graph coloring. Indeed, fractional coloring problems are much more amenable to a linear programming approach than traditional coloring problems.
A b-fold coloring of a graph G is an assignment of sets of size b to vertices of a graph such that adjacent vertices receive disjoint sets. An a:b-coloring is a b-fold coloring out of a available colors. Equivalently, it can be defined as a homomorphism to the Kneser graph KGa,b. The b-fold chromatic number is the least a such that an a:b-coloring exists.
The fractional chromatic number is defined to be
Note that the limit exists because is subadditive, meaning
The fractional chromatic number can equivalently be defined in probabilistic terms. is the smallest k for which there exists a probability distribution over the independent sets of G such that for each vertex v, given an independent set S drawn from the distribution,
We have
with equality for vertex-transitive graphs,
where n(G) is the order of G, α(G) is the independence number.
Moreover,
where ω(G) is the clique number, and is the chromatic number.
Furthermore, the fractional chromatic number approximates the chromatic number within a logarithmic factor, in fact:
Kneser graphs give examples where is arbitrarily large, since while
The fractional chromatic number of a graph G can be obtained as a solution to a linear program. Let be the set of all independent sets of G, and let be the set of all those independent sets which include vertex x.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.