Cover-Decomposition and polychromatic numbers

A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number, is the maximum number of disjoint hyperedge-covers. In...

Volledige beschrijving

Bibliografische gegevens
Hoofdauteurs: Bollobás, B, Pritchard, D, Rothvo, T, Scott, A
Formaat: Journal article
Taal:English
Gepubliceerd in: 2011

Gelijkaardige items