List Colorings with Measurable Sets

HLADKY, J; Daniel KRÁĽ; JS SERENI a M STIEBITZ. List Colorings with Measurable Sets. Journal of Graph Theory. HOBOKEN: Wiley, 2008, roč. 59, č. 3, s. 229-238. ISSN 0364-9024. Dostupné z: https://doi.org/10.1002/jgt.20335.

Základní údaje

Originální název

List Colorings with Measurable Sets

Autoři

HLADKY, J; Daniel KRÁĽ; JS SERENI a M STIEBITZ

Vydání

Journal of Graph Theory, HOBOKEN, Wiley, 2008, 0364-9024

---

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Utajení

není předmětem státního či obchodního tajemství

Impakt faktor

Impact factor: 0.655

Označené pro přenos do RIV

Ne

DOI

https://doi.org/10.1002/jgt.20335

UT WoS

000259944200005

Klíčová slova anglicky

fractional chromatic number; Hall's theorem; list coloring; measurable sets

---

Anotace

V originále

The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, then there exist sets c(v) subset of L(v) such that each c(v) has measure one and c(v) boolean AND c(v') = phi for every pair of adjacent vertices v and V. We provide a simpler proof of a measurable generalization of Hall's theorem due to Hilton and Johnson [J Graph Theory 54 (2007), 179-193] and show that the measurable list chromatic number of a finite graph G is equal to its fractional chromatic number. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 59: 229-238, 2008