### Abstract

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 fractional chromatic number of G.

Original language | English |
---|---|

Pages (from-to) | 31-38 |

Number of pages | 8 |

Journal | Discrete Mathematics |

Volume | 165-166 |

Publication status | Published - Mar 15 1997 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*165-166*, 31-38.

**Choosability and fractional chromatic numbers.** / Alon, N.; Tuza, Z.; Voigt, M.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 165-166, pp. 31-38.

}

TY - JOUR

T1 - Choosability and fractional chromatic numbers

AU - Alon, N.

AU - Tuza, Z.

AU - Voigt, M.

PY - 1997/3/15

Y1 - 1997/3/15

N2 - 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 fractional chromatic number of G.

AB - 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 fractional chromatic number of G.

UR - http://www.scopus.com/inward/record.url?scp=0002443622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0002443622&partnerID=8YFLogxK

M3 - Article

VL - 165-166

SP - 31

EP - 38

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

ER -