Skip to main content
Article
Licensed
Unlicensed Requires Authentication

An example of an infinite Steiner tree connecting an uncountable set

  • EMAIL logo , and
Published/Copyright: January 10, 2015

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).

MSC: 49Q10; 05C63

Funding source: St. Petersburg State University

Award Identifier / Grant number: #6.38.670.2013

Funding source: St. Petersburg State University

Award Identifier / Grant number: #6.38.223.2014

Funding source: Russian Government

Award Identifier / Grant number: NSh-1771.2014.1

Funding source: GNAMPA

Funding source: RFBR

Award Identifier / Grant number: #14-01-00534

Funding source: Italian Ministry of Research

Award Identifier / Grant number: 2010A2TFX2 “Calcolo delle variazioni”

Received: 2013-11-19
Revised: 2014-11-13
Accepted: 2014-12-1
Published Online: 2015-1-10
Published in Print: 2015-7-1

© 2015 by De Gruyter

Downloaded on 24.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/acv-2013-0025/html?lang=en
Scroll to top button