List colourings of regular hypergraphs

DOI10.1017/S0963548311000502MaRDI QIDQ2883869zbMATH OpenFDO

Authors David Saxton, Andrew Thomason

Publication date 14 May 2012

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548311000502

zbMATH Keywords

\(k\)-choosable hypergraphslist chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites work

• scientific article; zbMATH DE number 1496580 (Why is no real title available?)
• On list coloring Steiner triple systems

Cited in

(9)

• Counting independent sets in graphs
• List Coloring with a Bounded Palette
• Online containers for hypergraphs, with applications to linear equations
• List coloring triangle-free hypergraphs
• Hypergraph containers
• Extremal problems in hypergraph colourings
• List colorings of multipartite hypergraphs
• Simple containers for simple hypergraphs
• Chromatic-choosability of hypergraphs with high chromatic number

This page was built for publication: List colourings of regular hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883869)