Fractional colorings with large denomina
β
David C. Fisher
π
Article
π
1995
π
John Wiley and Sons
π
English
β 299 KB
## Abstract The __mβchromatic number__ Ο~m~(__G__) of a graph __G__ is the fewest colors needed so each node has __m__ colors and no color appears on adjacent nodes. The __fractional__ chromatic number is Ο\*(__G__)=lim~__m__ββ~Ο~m~(__G__)/__m__. Let __m__(__G__) be the least __m__ so that Ο\* (__G