Density conditions for panchromatic colourings of hypergraphs
From MaRDI portal
(Redirected from Publication:1603255)
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.
Recommendations
Cited in
(9)- A note on panchromatic colorings
- Coupon-coloring and total domination in Hamiltonian planar triangulations
- A note on fractional disjoint transversals in hypergraphs
- Chain method for panchromatic colorings of hypergraphs
- On coupon colorings of graphs
- Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders
- The existence of panchromatic colourings for uniform hypergraphs
- Extremal problems in hypergraph colourings
- Parameterized complexity of coupon coloring of graphs
This page was built for publication: Density conditions for panchromatic colourings of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603255)
