On proper colourings of hypergraphs using prescribed colours
From MaRDI portal
Recommendations
- On proper colorings of hypergraphs
- ON HYPERGRAPH COLOURINGS
- Colorings of hypergraphs
- Proper coloring of geometric hypergraphs
- Proper coloring of geometric hypergraphs
- Hypergraph colouring
- scientific article; zbMATH DE number 5202627
- Complete colourings of hypergraphs
- scientific article; zbMATH DE number 25263
- On Some Extremal Properties of Hypergraph Colorings
Cites work
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Coloring n-sets red and blue
- Coloring uniform hypergraphs with few colors
- Ein kombinatorisches Problem von P. Erdős und A. Hajnal
- Hypergraphs with high chromatic number
- Improved bounds and algorithms for hypergraph 2-coloring
- On a combinatorial problem of P. Erdős and L. Lovasz
- On a combinatorial problem. II
- On a property of families of sets
- The minimum independence number for designs
Cited in
(6)- Extremal problems in hypergraph colourings
- On r-chromatic hypergraphs
- A contribution to the chromatic theory of uniform hypergraphs
- Selective hypergraph colourings
- scientific article; zbMATH DE number 6786475 (Why is no real title available?)
- On the existence of graphs with prescribed coloring parameters
This page was built for publication: On proper colourings of hypergraphs using prescribed colours
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057818)