Choosability and fractional chromatic numbers

Every 2-choosable graph is (2 m, m )-choosable

Zs. Tuza, Margit Voigt · Journal of Graph Theory · 1996 · 31 citations

Natural Sciences, Mathematics, Combinatorics +3

Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory

Noga Alon, Kenneth A. Berman · Journal of Combinatorial Theory Series A · 1986 · 21 citations

Natural Sciences, Computer Science, Mathematics +13

Every 2-choosable graph is (2m, m)-choosable

Zs. Tuza, Margit Voigt · Journal of Graph Theory · 1996 · 21 citations

Natural Sciences, Mathematics, Combinatorics +5

ON A CONJECTURE OF ERDÖS

Kōichi Yamamoto · Memoirs of the Faculty of Science Kyushu University Series A Mathematics · 1964 · 15 citations · Full text

Natural Sciences, Computer Science, Mathematics +5

The smallestn-uniform hypergraph with positive discrepancy

Noga Alon, Daniel J. Kleitman, Carl Pomerance et al. · COMBINATORICA · 1987 · 11 citations

Natural Sciences, Computer Science, Combinatorics +5