Choosability and fractional chromatic numbers

N. Alon, Z. Tuza, M. Voigt

Research output: Contribution to journalArticle

23 Citations (Scopus)

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 languageEnglish
Pages (from-to)31-38
Number of pages8
JournalDiscrete Mathematics
Volume165-166
Publication statusPublished - Mar 15 1997

Fingerprint

Fractional Chromatic number
Choosability
Color
Subset
Graph in graph theory
Disjoint
Assignment
Adjacent
Integer
Range of data

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Alon, N., Tuza, Z., & Voigt, M. (1997). Choosability and fractional chromatic numbers. Discrete Mathematics, 165-166, 31-38.

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

In: Discrete Mathematics, Vol. 165-166, 15.03.1997, p. 31-38.

Research output: Contribution to journalArticle

Alon, N, Tuza, Z & Voigt, M 1997, 'Choosability and fractional chromatic numbers', Discrete Mathematics, vol. 165-166, pp. 31-38.
Alon, N. ; Tuza, Z. ; Voigt, M. / Choosability and fractional chromatic numbers. In: Discrete Mathematics. 1997 ; Vol. 165-166. pp. 31-38.
@article{121368f470da4ac69fa707d644c88040,
title = "Choosability and fractional chromatic numbers",
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.",
author = "N. Alon and Z. Tuza and M. Voigt",
year = "1997",
month = "3",
day = "15",
language = "English",
volume = "165-166",
pages = "31--38",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",

}

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 -