Density conditions for panchromatic colourings of hypergraphs
type: Item
instance of: scholarly article
title: Density conditions for panchromatic colourings of hypergraphs
zbMATH Open document ID: 0989.05037
published in: Combinatorica
publication date: 2002-06-25T00:00:00Z
review text: A panchromatic \(t\)-colouring of a hypergraph \( H =(V,E)\) is a \(t\)-colouring such that each edge has at least one vertex of each colour. Hypergraph \(H\) is panchromatically \(t\)-choosable (panchromatically \(t\)-list-colourable) if, whenever each vertex is given a list of \(t\) colours, the vertices can be panchromatically \(t\)-coloured by using colours from their lists. The number of conditions (depending on the Hall ratio) of a hypergraph to be panchromatically \(t\)-choosable and \(t\)-colourable are given.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1759145
zbMATH Keywords: hypergraph
zbMATH Keywords: panchromatic colouring and list colouring
zbMATH Keywords: Hall ratio
author: Alexandr Kostochka
author: Douglas R. Woodall
reviewed by: Fedor V. Fomin
MaRDI profile type: Publication
full work available at URL: s004930100011
OpenAlex ID: W2055108763
DOI: 10.1007/S004930100011
description: scientific article; zbMATH DE number 1759145