Pages that link to "Item:Q1152407"
From MaRDI portal
The following pages link to A remark concerning arithmetic progressions (Q1152407):
Displaying 10 items.
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- Coloring uniform hypergraphs with few edges (Q3055779) (← links)
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number (Q3211360) (← links)
- Multipass greedy coloring of simple uniform hypergraphs (Q3467582) (← links)
- Monochromatic arithmetic progressions with large differences (Q4265856) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- Piecewise syndetic sets in \(\mathbb{N}^t\) and \(\mathbb{N}^X\) (Q6542777) (← links)