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
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
