Leafy spanning trees in hypercubes (Q5950587)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Leafy spanning trees in hypercubes |
scientific article; zbMATH DE number 1684749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Leafy spanning trees in hypercubes |
scientific article; zbMATH DE number 1684749 |
Statements
Leafy spanning trees in hypercubes (English)
0 references
2 January 2002
0 references
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)].
0 references
leaves in trees of hypercubes
0 references
0.812799870967865
0 references
0.8111559152603149
0 references
0.808880090713501
0 references
0.7769027352333069
0 references
0.7750126123428345
0 references