A generalization of maximal \(k\)-multiple-free sets of integers
From MaRDI portal
Publication:2761010
zbMATH Open0993.11001MaRDI QIDQ2761010
Publication date: 17 December 2001
Published in: Ars Combinatoria (Search for Journal in Brave)
Other combinatorial number theory (11B75) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Cited In (8)
- Title not available (Why is that?)
- On constant-multiple-free sets contained in a random set of integers
- A generalisation of maximal \((k, b)\)-linear-free sets of integers
- The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\)
- On the structure of sets with many k-term arithmetic progressions
- Incidences with $k$-non-degenerate sets and their applications
- \(d\)-cluster-free sets with a given matching number
- On maximal \((k,b)\)-linear-free sets of integers and its spectrum
This page was built for publication: A generalization of maximal \(k\)-multiple-free sets of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2761010)