An improved construction of progression-free sets
From MaRDI portal
Cited in
(6)- Perfect proper edge colorings of regular bipartite graphs with rainbow \(C_4\)-\(\mathrm{s}\)
- An improved protocol for ExactlyN with more than 3 players
- Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
- Arithmetic progressions and thickness properties in self-similar Cantor sets
- The four corners problem over larger alphabets
- On subsets of lattice cubes avoiding affine and spherical degeneracies
This page was built for publication: An improved construction of progression-free sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827756)