Paper Info
Title
List colourings of regular hypergraphs
Abstract
We show that the list chromatic number of a simple d-regular r-uniform hypergraph is at least (1/2r log(2r2) + o(1)) log d if d is large.
Year
DOI
Venue
2012
10.1017/S0963548311000502
Combinatorics, Probability & Computing
Keywords
DocType
Volume
list colouring,simple d-regular r-uniform hypergraph,regular hypergraphs,list chromatic number
Journal
21
Issue
ISSN
Citations 
1-2
0963-5483
3
PageRank 
References 
Authors
0.46
4
2
Name
Order
Citations
PageRank
David Saxton1133.15
Andrew Thomason27116.01