A KNOTTED MINIMAL TREE

DOI10.1142/S0219199799000055MaRDI QIDQ4514919zbMATH OpenFDO

Authors Krystyna Kuperberg

Publication date 14 November 2000

Published in Communications in Contemporary Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9806080

zbMATH Keywords

minimal treeknotted graph

Mathematics Subject Classification ID

Trees (05C05) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Relations of low-dimensional topology with graph theory (57M15)

Abstract: This paper contains a construction of a finite set X in the boundary of the unit 3-ball in R^3 whose minimal tree is knotted. The example answers Problem 5.17 in Problems in Low-dimensional Topology by Rob Kirby posed by Michael Freedman: Given a finite set of points X in the boundary of B^3, let T be a tree in B^3 of minimal length containing X. Is T unknotted, that is, is there a PL imbedded 2-ball in B^3 containing T?

Recommendations

• Minimally colored trees
• The tree of knot tunnels
• Steiner minimal trees
• Minimal Locked Trees
• Diameter minimal trees
• Minimal spanning forests
• scientific article; zbMATH DE number 1428888
• scientific article; zbMATH DE number 807799
• Minimal spanning trees
• Minimal configuration trees

Cited in

(2)

• An open ended tree
• Minimally colored trees

This page was built for publication: A KNOTTED MINIMAL TREE

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