Choosability and fractional chromatic numbers

DOI10.1016/S0012-365X(96)00159-8zbMath0877.05020OpenAlexW2055085175MaRDI QIDQ1356727

Zsolt Tuza, Margit Voigt, Noga Alon

Publication date: 2 December 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00159-8

zbMATH Keywords

fractional chromatic numberchoosabilitychoice ratio

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

Path choosability of planar graphs, Free choosability of outerplanar graphs, The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs, Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable, Fractional DP-chromatic number of planar graphs of large girth, Multiple list colouring of planar graphs, Every planar graph is 1-defective \((9,2)\)-paintable, The strong fractional choice number of 3‐choice‐critical graphs, Refined List Version of Hadwiger’s Conjecture, Coloring temporal graphs, On-line list coloring of matroids, Complexity-penalized estimation of minimum volume sets for dependent data, Choosability and paintability of the lexicographic product of graphs, The strong fractional choice number of series-parallel graphs, Multiple list colouring triangle free planar graphs, Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles, Complexity of choosing subsets from color sets, On structure of some plane graphs with application to choosability, Graph imperfection. I, Characterization of \((2m,m)\)-paintable graphs, On (4, 2)‐Choosable Graphs

Cites Work

• Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
• The smallest n-uniform hypergraph with positive discrepancy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item