Vladimir Blinovsky

Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primes
dmtcs:3453 
Discrete Mathematics & Theoretical Computer Science,
January 1, 2005,
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)

https://doi.org/10.46298/dmtcs.3453
Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primesArticle
Authors: Vladimir Blinovsky ^{1}
NULL
Vladimir Blinovsky
1 Fakultät für Mathematik = Faculty of Mathematics [Bielefeld]
We find the formula for the cardinality of maximal set of integers from $[1,\ldots,n]$ which does not contain $k+1$ pairwise coprimes and has divisors from a specified set of primes. This formula is defined by the set of multiples of the generating set, which does not depend on $n$.