Geodesic
Every Steiner triple system contains almost spanning \(d\)-ary hypertree
The electronic journal of combinatorics, Tome 29 (2022) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we make a partial progress on the following conjecture: for every $\mu>0$ and large enough $n$, every Steiner triple system $S$ on at least $(1+\mu)n$ vertices contains every hypertree $T$ on $n$ vertices. We prove that the conjecture holds if $T$ is a perfect $d$-ary hypertree.
DOI : 10.37236/10454
Classification : 05B07, 05C65, 05C05
Mots-clés : Steiner triple system, perfect \(d\)-ary hypertree 
@article{10_37236_10454,
     author = {Andrii Arman and Vojt\v{e}ch R\"odl and Marcelo Tadeu Sales},
     title = {Every {Steiner} triple system contains almost spanning \(d\)-ary hypertree},
     journal = {The electronic journal of combinatorics},
     year = {2022},
     volume = {29},
     number = {3},
     doi = {10.37236/10454},
     zbl = {1504.05031},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10454/}
}
TY  - JOUR
AU  - Andrii Arman
AU  - Vojtěch Rödl
AU  - Marcelo Tadeu Sales
TI  - Every Steiner triple system contains almost spanning \(d\)-ary hypertree
JO  - The electronic journal of combinatorics
PY  - 2022
VL  - 29
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10454/
DO  - 10.37236/10454
ID  - 10_37236_10454
ER  - 
%0 Journal Article
%A Andrii Arman
%A Vojtěch Rödl
%A Marcelo Tadeu Sales
%T Every Steiner triple system contains almost spanning \(d\)-ary hypertree
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/10454/
%R 10.37236/10454
%F 10_37236_10454
Andrii Arman; Vojtěch Rödl; Marcelo Tadeu Sales. Every Steiner triple system contains almost spanning \(d\)-ary hypertree. The electronic journal of combinatorics, Tome 29 (2022) no. 3. doi: 10.37236/10454

Cité par Sources :