Timeline for Joining the $2^k$ points of $\{0,1\}^k$ with the shortest tree

8 events

when toggle format	what		by	license	comment
Jun 13 at 2:42	vote	accept	Marco Ripà
Jun 11 at 19:34	history	edited	David E Speyer	CC BY-SA 4.0	added 126 characters in body
Jun 11 at 18:52	history	edited	David E Speyer	CC BY-SA 4.0	added 4 characters in body
Jun 11 at 18:17	history	edited	David E Speyer	CC BY-SA 4.0	added 238 characters in body
Jun 11 at 18:10	comment	added	Peter Taylor		There are obviously equivalent trees by permuting the basis, but in higher dimensions it's also possible to rotate subtrees, so a proof of optimality has to take that into account. My intuition is that it would begin by considering how the vertices can be paired up and which plane the edges of a given pair must lie in.
Jun 11 at 16:25	history	edited	David E Speyer	CC BY-SA 4.0	added 536 characters in body
Jun 11 at 16:19	history	edited	David E Speyer	CC BY-SA 4.0	added 536 characters in body
Jun 11 at 15:41	history	answered	David E Speyer	CC BY-SA 4.0