Every 2-Choosable Graph is (2m, m)-Choosable

Zs Tuza, M. Voigt

Research output: Contribution to journalArticle

17 Citations (Scopus)


A graph G = (V, E) with vertex set V and edge set E is called (a, b)-choosable (a ≥ 2b) if for any collection {L(v)|v ∈ V} of sets L(v) of cardinality a there exist a collection {C(v)|v ∈ V} of subsets C(v) ⊂ L(v),|C(v)| = b, such that C(v) ∩ C(w) = ∅ for all vw ∈ E. Giving a partial solution to a problem raised by Erdös, Rubin, and Taylor in 1979, we prove that every (2, 1)-choosable graph is (2m, m)-choosable for all m > 1.

Original languageEnglish
Pages (from-to)245-252
Number of pages8
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - Jul 1996


ASJC Scopus subject areas

  • Geometry and Topology

Cite this