Choosability and fractional chromatic numbers


A graph G is (a, b)-choosable if for any assignment of a list of a colors to each of its vertices there is a subset of b colors of each list so that subsets corresponding to adjacent vertices are disjoint. It is shown that for every graph G, the minimum ratio a/b where a, b range over all pairs of integers for which G is (a, b)-choosable is equal to the… (More)
DOI: 10.1016/S0012-365X(96)00159-8


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics