On the structure of the tight-span of a totally split-decomposable metric

DOI10.1016/j.ejc.2004.05.007zbMath1094.54012OpenAlexW2050222624MaRDI QIDQ820090

Vincent L. Moulton, Jack H. Koolen, Katharina T. Huber

Publication date: 6 April 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.05.007

zbMATH Keywords

tight span of a metric spacecell-decomposable metrictotally split-decomposable metric

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Polytopes and polyhedra (52B99)

Related Items (6)

Compatibility of partitions with trees, hierarchies, and split systems ⋮ The polytopal structure of the tight-span of a totally split-decomposable metric ⋮ Bipartite diametrical graphs of diameter 4 and extreme orders ⋮ Counting vertices and cubes in median graphs of circular split systems ⋮ Hyperconvexity and tight-span theory for diversities ⋮ Optimal realizations of two-dimensional, totally-decomposable metrics

Uses Software

• SplitsTree

Cites Work

• Unnamed Item
• An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• A canonical decomposition theory for metrics on a finite set
• A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction
• Some variations on a theme by Buneman
• Antipodal metrics and split systems
• Tropical convexity
• The tight span of an antipodal metric space. II: Geometrical properties
• On the tight span of an antipodal graph
• Six theorems about injective metric spaces
• The tight span of an antipodal metric space. I: combinatorial properties
• Generosity Helps or an 11-Competitive Algorithm for Three Servers
• Lectures on Polytopes
• Geometry of cuts and metrics
• Totally split-decomposable metrics of combinatorial dimension two
• Analyzing and visualizing sequence and distance data using SPLITSTREE

This page was built for publication: On the structure of the tight-span of a totally split-decomposable metric