Pages that link to "Item:Q927879"
From MaRDI portal
The following pages link to Finding large 3-free sets. I. The small \(n\) case (Q927879):
Displaying 9 items.
- On sets without \(k\)-term arithmetic progression (Q414926) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- Novel structures in Stanley sequences (Q898128) (← links)
- An improved construction of progression-free sets (Q1758902) (← links)
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
- The equidistant dimension of graphs (Q2147613) (← links)
- Numerical semigroups of Szemerédi type (Q2420402) (← links)
- Behrend-type constructions for sets of linear equations (Q5478114) (← links)
- (Q5875468) (← links)
