The Library
List colorings with measurable sets
Tools
Hladký, Jan, Kráal, Daniel, Sereni, Jean-Sébastien and Stiebitz, Michael (2008) List colorings with measurable sets. Journal of Graph Theory, Vol.59 (No.3). pp. 229-238. doi:10.1002/jgt.20335 ISSN 0364-9024.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1002/jgt.20335
Abstract
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 such that each c(v) has measure one and 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. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 229–238, 2008
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Journal of Graph Theory | ||||
Publisher: | John Wiley & Sons Ltd. | ||||
ISSN: | 0364-9024 | ||||
Official Date: | 2008 | ||||
Dates: |
|
||||
Volume: | Vol.59 | ||||
Number: | No.3 | ||||
Page Range: | pp. 229-238 | ||||
DOI: | 10.1002/jgt.20335 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |