LetGbe a loopless graph with noKp+1minor. We prove that the "fractional chromatic number" ofGis at most 2p; that is, it is possible to assign a rationalq(S)≥0 to every stable setS⊆V(G) so that ∑S∋vq(S)=1 for every vertexv, and ∑Sq(S)≤2p.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics