# Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primes

Abstract : 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$.
Keywords :
Type de document :
Communication dans un congrès
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.335-340, 2005, DMTCS Proceedings
Domaine :

Littérature citée [2 références]

https://hal.inria.fr/hal-01184442
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 10:50:15
Dernière modification le : jeudi 11 mai 2017 - 01:02:52
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 10:35:28

### Fichier

dmAE0165.pdf
Fichiers éditeurs autorisés sur une archive ouverte

### Identifiants

• HAL Id : hal-01184442, version 1

### Citation

Vladimir Blinovsky. Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primes. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.335-340, 2005, DMTCS Proceedings. 〈hal-01184442〉

### Métriques

Consultations de la notice

## 204

Téléchargements de fichiers