A KNOTTED MINIMAL TREE (Q4514919)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1530485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A KNOTTED MINIMAL TREE |
scientific article; zbMATH DE number 1530485 |
Statements
A KNOTTED MINIMAL TREE (English)
0 references
14 November 2000
0 references
knotted graph
0 references
minimal tree
0 references
0 references
The author gives an answer to the following problem posted by \textit{Michael Freedman} in ``Problems of low-dimensional topology'' by \textit{Rob Kirby} [Algebr. geom. Topol., Stanford/Calif. 1976, Proc. Symp. pure Math., Vol. 32, Part 2, 273-312 (1978; Zbl 0394.57002)]. Given a finite set of points \(X\) in \(\partial B^3\), let \(T\) be a tree in \(B^3\) of minimal length with \(\partial T = X\). Is \(T\) unknotted, that is, is there a PL-imbedded 2-ball in \(B^3\) containing \(T\)? The author constructs an elegant example of a finite set \(X\) whose minimal tree is knotted. The cardinality of \(X\) is quite large, but the number of trivalent vertices in the tree is only six.
0 references
