On coloring uniform hypergraphs without 3-cycles
From MaRDI portal
Publication:446271
Recommendations
Cited in
(17)- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
- 3-uniform hypergraphs without a cycle of length five
- Coloring sparse hypergraphs
- Chromatic numbers and homomorphisms of large girth hypergraphs
- On 3-uniform hypergraphs without linear cycles
- \(H\)-colorings of dense hypergraphs
- Constructions of sparse uniform hypergraphs with high chromatic number
- On rainbow-free colourings of uniform hypergraphs
- ON HYPERGRAPH COLOURINGS
- scientific article; zbMATH DE number 524137 (Why is no real title available?)
- Colourings of uniform hypergraphs with large girth and applications
- On regular hypergraphs with high girth and high chromatic number
- On 3-uniform hypergraphs without a cycle of a given length
- Random constructions of hypergraphs with large girth and without panchromatic colorings
- Coloring non-uniform hypergraphs without short cycles
- 2-colorings of hypergraphs with large girth
This page was built for publication: On coloring uniform hypergraphs without 3-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q446271)