Pages that link to "Item:Q742641"
From MaRDI portal
The following pages link to Coloring non-uniform hypergraphs without short cycles (Q742641):
Displaying 14 items.
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number (Q268128) (← links)
- Equitable colorings of non-uniform simple hypergraphs (Q322355) (← links)
- Equitable colorings of nonuniform hypergraphs (Q325641) (← links)
- On coloring uniform hypergraphs without 3-cycles (Q446271) (← links)
- A hypergraph-free construction of highly chromatic graphs without short cycles (Q915736) (← links)
- On Ramsey families of sets (Q917575) (← links)
- High girth hypergraphs with unavoidable monochromatic or rainbow edges (Q2118239) (← links)
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs (Q2352063) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- On colorings of non-uniform hypergraphs without short cycles (Q2857438) (← links)
- Greedy colorings of uniform hypergraphs (Q3055773) (← links)
- Coloring uniform hypergraphs with few edges (Q3055779) (← links)
- Uncountable dichromatic number without short directed cycles (Q5110680) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
