Pages that link to "Item:Q4643316"
From MaRDI portal
The following pages link to Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316):
Displaying 10 items.
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- High girth hypergraphs with unavoidable monochromatic or rainbow edges (Q2118239) (← links)
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets (Q2191992) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- Equitable colorings of hypergraphs with few edges (Q2309544) (← links)
- Panchromatic 3-colorings of random hypergraphs (Q2422211) (← links)
- Random constructions of hypergraphs with large girth and without panchromatic colorings (Q2671969) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
