Geodesic
Berge cycles in non-uniform hypergraphs
Zoltán Füredi ; Alexandr Kostochka ; Ruth Luo1
1University of Illinois at Urbana Champaign
The electronic journal of combinatorics, Tome 27 (2020) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with bounded circumference. Both results are best possible in infinitely many cases.
DOI : 10.37236/9346
Classification : 05C65, 05C35, 05C38, 05C30
Mots-clés : set systems without long Berge cycles, Dirac-type minimum degree conditions

Zoltán Füredi    ; Alexandr Kostochka    ; Ruth Luo  1

1 University of Illinois at Urbana Champaign 
@article{10_37236_9346,
     author = {Zolt\'an F\"uredi and Alexandr Kostochka and Ruth Luo},
     title = {Berge cycles in non-uniform hypergraphs},
     journal = {The electronic journal of combinatorics},
     year = {2020},
     volume = {27},
     number = {3},
     doi = {10.37236/9346},
     zbl = {1444.05101},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/9346/}
}
TY  - JOUR
AU  - Zoltán Füredi
AU  - Alexandr Kostochka
AU  - Ruth Luo
TI  - Berge cycles in non-uniform hypergraphs
JO  - The electronic journal of combinatorics
PY  - 2020
VL  - 27
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/9346/
DO  - 10.37236/9346
ID  - 10_37236_9346
ER  - 
%0 Journal Article
%A Zoltán Füredi
%A Alexandr Kostochka
%A Ruth Luo
%T Berge cycles in non-uniform hypergraphs
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/9346/
%R 10.37236/9346
%F 10_37236_9346
Zoltán Füredi; Alexandr Kostochka; Ruth Luo. Berge cycles in non-uniform hypergraphs. The electronic journal of combinatorics, Tome 27 (2020) no. 3. doi: 10.37236/9346

Cité par Sources :