Minimal Steiner trees for rectangular arrays of lattice points (Q1364229): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jcta.1996.2751 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2063178228 / rank | |||
Normal rank |
Revision as of 22:25, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimal Steiner trees for rectangular arrays of lattice points |
scientific article |
Statements
Minimal Steiner trees for rectangular arrays of lattice points (English)
0 references
5 February 1998
0 references
By distinction of several cases, the authors are able to construct a minimal Steiner tree for an arbitrary rectangular array of integer lattice points in the plane. For \(n\times n\)-arrays, this proves a conjecture by \textit{F. Chung}, \textit{M. Gardner} and \textit{R. Graham} [Math. Mag. 62, No. 2, 83-96 (1989; Zbl 0681.05018)] with the exception of the case \(n\equiv 0\bmod 6\), \(n>6\), where the authors were able to improve the conjecture. The proof rests on a theorem of another paper by the same authors [J. Comb. Theory, Ser. A 78, No. 1, 51-91 (1997; Zbl 0874.05018)], which characterizes the full components of a minimal Steiner tree for somewhat more general lattice sets. For non-square rectangular arrays, the proof is rather involved, but many drawings help to understand the constructions.
0 references
minimal Steiner trees
0 references
full components of a Steiner tree
0 references
lattice points
0 references