Pages that link to "Item:Q896005"
From MaRDI portal
The following pages link to Improved algorithms for colorings of simple hypergraphs and applications (Q896005):
Displayed 13 items.
- A new lower bound for van der Waerden numbers (Q1686261) (← links)
- Colorings of \(b\)-simple hypergraphs (Q1689874) (← links)
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings (Q2084984) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← 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)
- Monochromatic Hilbert cubes and arithmetic progressions (Q2415085) (← links)
- Panchromatic 3-colorings of random hypergraphs (Q2422211) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- Random constructions of hypergraphs with large girth and without panchromatic colorings (Q2671969) (← links)
- Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)