On a generalization of Rubin's theorem

DOI10.1002/jgt.20527zbMath1232.05081OpenAlexW2050616133MaRDI QIDQ3018075

Dmitriy A. Shabanov

Publication date: 21 July 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20527

zbMATH Keywords

choice numberhypergraph panchromatic coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Improper Choosability and Property B ⋮ Chain method for panchromatic colorings of hypergraphs ⋮ Panchromatic 3-coloring of a random hypergraph ⋮ A note on panchromatic colorings ⋮ Panchromatic 3-colorings of random hypergraphs ⋮ The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ Extremal problems in hypergraph colourings ⋮ Panchromatic colorings of random hypergraphs

Cites Work

• On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
• On the choosability of complete multipartite graphs with part size three
• The existence of panchromatic colourings for uniform hypergraphs
• Choice Numbers of Graphs: a Probabilistic Approach
• Improved bounds and algorithms for hypergraph 2-coloring
• Extremal problems for colourings of uniform hypergraphs
• On the asymptotic value of the choice number of complete multi‐partite graphs
• On a property of families of sets
• On a combinatorial problem. II

This page was built for publication: On a generalization of Rubin's theorem