Abstract
In this short paper we improve an almost 30 years old result of Erdős, Sárközy and Sós on lower bounds for the size of multiplicative square-free sequences. Our construction uses Berge-cycle free hypergraphs that is interesting in its own right.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have