scientific article; zbMATH DE number 3859148
[For the entire collection see Zbl 0524.00011.] Let \(B_ n\) denote the n-dimensional cube. We say that the tree T can be embedded into the cube \(B_ n\) if there exists a subgraph of \(B_ n\) isomorphic to T. Let I(T) denote the minimal dimension of a cube containing a subgraph isomorphic to T and H(T) denote the minimal dimension of a cube containing a subgraph T' homeomorphic to T. In Theorem 1 \(H(D_ k)\) is determined to be equal to k, where \(D_ k\) is the binary tree with k levels. In Theorem 2 it is shown that for arbitrary constant c there exists an infinite class of trees with property: \(I(T)/H(T)>c.\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328561)