Maximal sets of numbers not containing \(k+1\) pairwise coprimes and having divisors from a specified set of primes

DOI10.1016/j.jcta.2006.03.015zbMath1203.11029OpenAlexW2090751955MaRDI QIDQ855861

Vladimir Blinovsky

Publication date: 7 December 2006

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.015

zbMATH Keywords

greatest common divisorsquarefree numberscoprimesnumber theoretical extremal problems

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Related Items (3)

The full automorphism groups, determining sets and resolving sets of coprime graphs ⋮ BSC reliability function under list decoding ⋮ Remark on the reliability function of a symmetric channel under list decoding

Cites Work

• Maximal sets of numbers not containing k+1 pairwise coprime integers
• Sets of integers with pairwise common divisor and a factor from a specified set of primes
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal sets of numbers not containing \(k+1\) pairwise coprimes and having divisors from a specified set of primes