On the Turán density of \(\{1, 3\}\)-hypergraphs
The electronic journal of combinatorics, Tome 26 (2019) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper, we consider the Turán problems on $\{1,3\}$-hypergraphs. We prove that a $\{1, 3\}$-hypergraph is degenerate if and only if it's $H^{\{1, 3\}}_5$-colorable, where $H^{\{1, 3\}}_5$ is a hypergraph with vertex set $V=[5]$ and edge set $E=\{\{2\}, \{3\}, \{1, 2, 4\},\{1, 3, 5\}, \{1, 4, 5\}\}.$ Using this result, we further prove that for any finite set $R$ of distinct positive integers, except the case $R=\{1, 2\}$, there always exist non-trivial degenerate $R$-graphs. We also compute the Turán densities of some small $\{1,3\}$-hypergraphs.
DOI : 10.37236/8072
Classification : 05C65, 05D40

Shuliang Bai  1   ; Linyuan Lu  2

1 Harvard University
2 University of South Carolina
@article{10_37236_8072,
     author = {Shuliang Bai and Linyuan Lu},
     title = {On the {Tur\'an} density of \(\{1, 3\}\)-hypergraphs},
     journal = {The electronic journal of combinatorics},
     year = {2019},
     volume = {26},
     number = {1},
     doi = {10.37236/8072},
     zbl = {1409.05141},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/8072/}
}
TY  - JOUR
AU  - Shuliang Bai
AU  - Linyuan Lu
TI  - On the Turán density of \(\{1, 3\}\)-hypergraphs
JO  - The electronic journal of combinatorics
PY  - 2019
VL  - 26
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/8072/
DO  - 10.37236/8072
ID  - 10_37236_8072
ER  - 
%0 Journal Article
%A Shuliang Bai
%A Linyuan Lu
%T On the Turán density of \(\{1, 3\}\)-hypergraphs
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/8072/
%R 10.37236/8072
%F 10_37236_8072
Shuliang Bai; Linyuan Lu. On the Turán density of \(\{1, 3\}\)-hypergraphs. The electronic journal of combinatorics, Tome 26 (2019) no. 1. doi: 10.37236/8072

Cité par Sources :