AN EXAMPLE OF AN INFINITE STEINER TREE CONNECTING AN UNCOUNTABLE SET
Abstract
We construct an example of a Steiner tree with an infinite number of branching points connecting an uncountable set of points. Such a tree is proven to be the unique solution to a Steiner problem for the given set of points. As a byproduct we get the whole family of explicitly defined finite Steiner trees, which are unique connected solutions of the Steiner problem for some given finite sets of points, and with growing complexity (i.e. the number of branching points).
Domains
Mathematics [math]Origin | Files produced by the author(s) |
---|