On a problem of Erdős on integers, none of which divides the product of \(k\) others

DOI10.1016/j.ejc.2009.02.005zbMath1255.11008OpenAlexW2064183481MaRDI QIDQ1041201

Tsz Ho Chan, András Sárközy, Ervin Gyoeri

Publication date: 1 December 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.02.005

zbMATH Keywords

multiplicative Sidon setprimitive set

Mathematics Subject Classification ID

Applications of graph theory (05C90) Extremal set theory (05D05) Other combinatorial number theory (11B75)

Related Items (6)

On infinite multiplicative Sidon sets ⋮ On the critical exponent for \(k\)-primitive sets ⋮ On sets of integers, none of which divides the product of \(k\) others ⋮ The counting version of a problem of Erdős ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A generalization of primitive sets and a conjecture of Erd\H{o}s

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of finite sets in which no set is covered by the union of \(r\) others
• \(C_ 6\)-free bipartite graphs and product representation of squares
• On the density of primitive sets
• On product representation of powers. I
• The Existence and Construction of Balanced Incomplete Block Designs
• An extremal problem for paths in bipartite graphs

This page was built for publication: On a problem of Erdős on integers, none of which divides the product of \(k\) others