Abstract We consider embeddings of the complete t -ary trees of depth k (denotation T k , t ) as subgraphs into the hypercube of minimum dimension n . This n , denoted by dim( T k , t ), is known if max{ k , t }⩽2. First, we study the next open cases t =3 and k =3. We improve the known upper bound dim( T k ,3 )⩽2 k +1 up to lim k →∞ dim( T k ,3 )/ k ⩽5/3 and show lim t →∞ dim( T 3, t )/ t =227/120. As a co-result, we present an exact formula for the dimension of arbitrary trees of depth 2, as a function of their vertex degrees. These results and new techniques provide an improvement of the known upper bound for dim( T k , t ) for arbitrary k and t .
[1]
Frank Harary,et al.
Graph Theory
,
2016
.
[2]
Alan Wagner,et al.
Embedding trees in the hypercube
,
1987
.
[3]
L. Nebeský.
On cubes and dichotomic trees
,
1974
.
[4]
L. Moser,et al.
AN EXTREMAL PROBLEM IN GRAPH THEORY
,
2001
.
[5]
P. Erdös.
On an extremal problem in graph theory
,
1970
.
[6]
Ivan Havel,et al.
Embedding the polytomic tree into the $n$-cube
,
1973
.
[7]
Sergei L. Bezrukov.
On Oriented Embedding of the Binary tree into the Hypercube
,
1994,
Comb. Probab. Comput..