Let G be a loopless graph with no Kp+1 minor. We prove that the ''frac
tional chromatic number'' of G is at most 2p; that is, it is possible
to assign a rational q(S) greater than or equal to 0 to every stable s
et S subset of or equal to V(G) so that Sigma(S There Exists upsilon)
q(S) = 1 for every vertex upsilon, and Sigma S q(S) less than or equal
to 2p. (C) 1998 Academic Press.