Leafy spanning trees in hypercubes

From MaRDI portal





A lower bound is found for the number of leaves of a spanning tree in a \(d\)-dimensional hypercube. This improves on the bound implied by a more general result of \textit{D. J. Kleitman} and \textit{D. B. West} [SIAM J. Discrete Math. 4, No. 1, 99-106 (1991; Zbl 0734.05041)].











This page was built for publication: Leafy spanning trees in hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950587)