Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]

DOI10.1016/0097-3165(89)90049-6zbMath0672.10039OpenAlexW1974928926MaRDI QIDQ1119966

Allen R. Freedman, Thomas C. Brown

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(89)90049-6

zbMATH Keywords

arithmetic progressionssmall setsminimum cardinality

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Arithmetic progressions (11B25)

Related Items (1)

A generalization of sets without long arithmetic progressions based on Szekeres algorithm

Cites Work

• On sets of integers containing k elements in arithmetic progression
• On sequences of integers containing no arithmetic progression

This page was built for publication: Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]