Pages that link to "Item:Q446271"
From MaRDI portal
The following pages link to On coloring uniform hypergraphs without 3-cycles (Q446271):
Displaying 15 items.
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number (Q268128) (← links)
- On regular hypergraphs with high girth and high chromatic number (Q314149) (← links)
- \(H\)-colorings of dense hypergraphs (Q456171) (← links)
- On 3-uniform hypergraphs without a cycle of a given length (Q516784) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three (Q1306277) (← links)
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs (Q1637144) (← links)
- On rainbow-free colourings of uniform hypergraphs (Q1981770) (← links)
- 3-uniform hypergraphs without a cycle of length five (Q2182003) (← links)
- Random constructions of hypergraphs with large girth and without panchromatic colorings (Q2671969) (← links)
- Coloring sparse hypergraphs (Q2813339) (← links)
- On colorings of non-uniform hypergraphs without short cycles (Q2857438) (← links)
- Constructions of sparse uniform hypergraphs with high chromatic number (Q3055877) (← links)
- ON HYPERGRAPH COLOURINGS (Q3728019) (← links)
- On 3-uniform hypergraphs without linear cycles (Q5963391) (← links)
