The counting version of a problem of Erdős

DOI10.1016/j.ejc.2020.103187zbMath1458.11050arXiv2009.05305OpenAlexW3043928474MaRDI QIDQ2225400

Richárd Palincza, Péter Pál Pach

Publication date: 8 February 2021

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

Full work available at URL: https://arxiv.org/abs/2009.05305

zbMATH Keywords

multiplicative basisenumeration of multiplicative Sidon setsenumeration of primitive setsproblem of Erdős on integers

Mathematics Subject Classification ID

Extremal set theory (05D05) Other combinatorial number theory (11B75)

Cites Work

• Unnamed Item
• Hypergraph containers
• On sets of integers, none of which divides the product of \(k\) others
• On a problem of Erdős on integers, none of which divides the product of \(k\) others
• On the structure of large sum-free sets of integers
• Sharp bound on the number of maximal sum-free subsets of integers
• Multiplicative bases and an Erdős problem
• The number of multiplicative Sidon sets of integers
• Nonisomorphic Steiner triple systems
• The number of maximal sum-free subsets of integers
• Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers
• The Number of Subsets of Integers with Nok-Term Arithmetic Progression
• The number of Bh‐sets of a given cardinality
• THE CAMERON–ERDOS CONJECTURE
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• Independent sets in hypergraphs
• On the Number ofB_h-Sets
• A Cameron and Erd\"os conjecture on counting primitive sets

This page was built for publication: The counting version of a problem of Erdős