Colorings versus list colorings of uniform hypergraphs
- 15 February 2020
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 95 (3) , 384-397
Abstract
Let be an integer with and be a connected ‐uniform hypergraph with edges. By refining the broken cycle theorem for hypergraphs, we show that if , then the ‐list assignment of admitting the fewest colorings is the constant list assignment. This extends the previous results of Donner, Thomassen, and the current authors for graphs.
Keywords
Funding Information
- National Natural Science Foundation of China (11971406, 11561058)
This publication has 18 references indexed in Scilit:
- An Abstraction of Whitney's Broken Circuit TheoremThe Electronic Journal of Combinatorics, 2014
- Hypergraph list coloring and Euclidean Ramsey theoryRandom Structures & Algorithms, 2011
- Improper choosability of graphs and maximum average degreeJournal of Graph Theory, 2006
- Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It DifficultAlgorithmica, 2005
- Degrees and choice numbersRandom Structures & Algorithms, 2000
- The complexity of G-free colourabilityDiscrete Mathematics, 1997
- Asymptotically Good List-ColoringsJournal of Combinatorial Theory, Series A, 1996
- Restricted colorings of graphs1993
- On the number of list‐coloringsJournal of Graph Theory, 1992
- Choice Numbers of Graphs: a Probabilistic ApproachCombinatorics, Probability and Computing, 1992