Improved Lower Bounds for Multiplicative Square-Free Sequences
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.
Gespeichert in:
| Veröffentlicht in: | The Electronic journal of combinatorics 2023-12, Vol.30 (4) |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| ISSN: | 1077-8926 1077-8926 |
| DOI: | 10.37236/11477 |