Geodesic
On \(3\)-uniform hypergraphs avoiding a cycle of length four
Beka Ergemlidze ; Ervin Győri ; Abhishek Methuku ; Nika Salia1 ; Casey Tompkins
1Alfréd Rényi Institute of Mathematics
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

We show that the maximum number of edges in a $3$-uniform hypergraph without a Berge cycle of length four is at most $(1+o(1))\frac{n^{3/2}}{\sqrt{10}}$. This improves earlier estimates by Győri and Lemons and by Füredi and Özkahya.
DOI : 10.37236/11443
Classification : 05C65, 05C30, 05C38, 05C12
Mots-clés : Turán number, cycles, extremal graphs, triple systems

Beka Ergemlidze    ; Ervin Győri    ; Abhishek Methuku    ; Nika Salia  1   ; Casey Tompkins 

1 Alfréd Rényi Institute of Mathematics 
@article{10_37236_11443,
     author = {Beka Ergemlidze and Ervin  Gy\H{o}ri and Abhishek  Methuku and Nika Salia and Casey Tompkins},
     title = {On \(3\)-uniform hypergraphs avoiding a cycle of length four},
     journal = {The electronic journal of combinatorics},
     year = {2023},
     volume = {30},
     number = {4},
     doi = {10.37236/11443},
     zbl = {1532.05123},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/11443/}
}
TY  - JOUR
AU  - Beka Ergemlidze
AU  - Ervin  Győri
AU  - Abhishek  Methuku
AU  - Nika Salia
AU  - Casey Tompkins
TI  - On \(3\)-uniform hypergraphs avoiding a cycle of length four
JO  - The electronic journal of combinatorics
PY  - 2023
VL  - 30
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/11443/
DO  - 10.37236/11443
ID  - 10_37236_11443
ER  - 
%0 Journal Article
%A Beka Ergemlidze
%A Ervin  Győri
%A Abhishek  Methuku
%A Nika Salia
%A Casey Tompkins
%T On \(3\)-uniform hypergraphs avoiding a cycle of length four
%J The electronic journal of combinatorics
%D 2023
%V 30
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/11443/
%R 10.37236/11443
%F 10_37236_11443
Beka Ergemlidze; Ervin  Győri; Abhishek  Methuku; Nika Salia; Casey Tompkins. On \(3\)-uniform hypergraphs avoiding a cycle of length four. The electronic journal of combinatorics, Tome 30 (2023) no. 4. doi: 10.37236/11443

Cité par Sources :