Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXivMots-clés : weight function, uniform hypergraphs, Berge subgraphs, graph removal lemma
Sean English  1 ; Dániel Gerbner  2 ; Abhishek Methuku  3 ; Cory Palmer  4
Sean English; Dániel Gerbner; Abhishek Methuku; Cory Palmer. On the weight of Berge-\(F\)-free hypergraphs. The electronic journal of combinatorics, Tome 26 (2019) no. 4. doi: 10.37236/8504
@article{10_37236_8504,
author = {Sean English and D\'aniel Gerbner and Abhishek Methuku and Cory Palmer},
title = {On the weight of {Berge-\(F\)-free} hypergraphs},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {4},
doi = {10.37236/8504},
zbl = {1422.05073},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8504/}
}
TY - JOUR AU - Sean English AU - Dániel Gerbner AU - Abhishek Methuku AU - Cory Palmer TI - On the weight of Berge-\(F\)-free hypergraphs JO - The electronic journal of combinatorics PY - 2019 VL - 26 IS - 4 UR - http://geodesic.mathdoc.fr/articles/10.37236/8504/ DO - 10.37236/8504 ID - 10_37236_8504 ER -
Cité par Sources :