On proper colourings of hypergraphs using prescribed colours

DOI10.1515/DMA.2010.024zbMath1216.05037OpenAlexW1964957253MaRDI QIDQ3057818

A. P. Rozovskaya, Dmitriy A. Shabanov

Publication date: 17 November 2010

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2010.024

Mathematics Subject Classification ID

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

Related Items (2)

Extremal problems in hypergraph colourings ⋮ On \(r\)-chromatic hypergraphs

Cites Work

• Hypergraphs with high chromatic number
• Coloring n-sets red and blue
• On a combinatorial problem of P. Erdős and L. Lovasz
• The minimum independence number for designs
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• Coloring uniform hypergraphs with few colors
• Improved bounds and algorithms for hypergraph 2-coloring
• Ein kombinatorisches Problem von P. Erdős und A. Hajnal
• On a property of families of sets
• On a combinatorial problem. II

This page was built for publication: On proper colourings of hypergraphs using prescribed colours