Geodesic
Improved lower bounds for multiplicative square-free sequences
Péter Pál Pach ; Máté Vizer1
1Alfréd Rényi Institute of Mathematics,Hungarian Academy of Sciences
The electronic journal of combinatorics, Tome 30 (2023) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/11477
Classification : 05D99, 05C65, 11B75
Mots-clés : multiplicative Sidon problem, hypergraph girth problem

Péter Pál Pach    ; Máté Vizer  1

1 Alfréd Rényi Institute of Mathematics,Hungarian Academy of Sciences 
@article{10_37236_11477,
     author = {P\'eter P\'al Pach and M\'at\'e Vizer},
     title = {Improved lower bounds for multiplicative square-free sequences},
     journal = {The electronic journal of combinatorics},
     year = {2023},
     volume = {30},
     number = {4},
     doi = {10.37236/11477},
     zbl = {1532.05168},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/11477/}
}
TY  - JOUR
AU  - Péter Pál Pach
AU  - Máté Vizer
TI  - Improved lower bounds for multiplicative square-free sequences
JO  - The electronic journal of combinatorics
PY  - 2023
VL  - 30
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/11477/
DO  - 10.37236/11477
ID  - 10_37236_11477
ER  - 
%0 Journal Article
%A Péter Pál Pach
%A Máté Vizer
%T Improved lower bounds for multiplicative square-free sequences
%J The electronic journal of combinatorics
%D 2023
%V 30
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/11477/
%R 10.37236/11477
%F 10_37236_11477
Péter Pál Pach; Máté Vizer. Improved lower bounds for multiplicative square-free sequences. The electronic journal of combinatorics, Tome 30 (2023) no. 4. doi: 10.37236/11477

Cité par Sources :