Betweenness Structures of Small Linear Co-Size
P\'eter G.N. Szab\'o

TL;DR
This paper investigates the structure of small almost-metric betweenness relations in finite metric spaces, focusing on those with limited non-linear triangles and hereditary properties, extending previous characterizations.
Contribution
It characterizes the largest nonlinear almost-metric betweenness structures with specific hereditary properties and few non-degenerate triangles, advancing the understanding of metric hypergraph realizations.
Findings
Characterized largest nonlinear almost-metric betweenness structures.
Identified structures with a small linear number of non-degenerate triangles.
Extended previous results on metric betweenness and hypergraph realizations.
Abstract
One way to study the combinatorics of finite metric spaces is to study the betweenness relation associated with the metric space. In the hypergraph metrization problem, one has to find and characterize metric betweennesses whose collinear triples (or alternatively, non-degenerate triangles) coincide with the edges of a given -uniform hypergraph. Metrizability of different kinds of hypergraphs was investigated in the last decades. Chen showed that steiner triple systems are not metrizable, while Richmond and Richmond characterized linear betweennesses, i.e. metric betweennesses that realize the complete -uniform hypergraph. The latter result was also generalized to almost-metric betweennesses by Beaudou et al. In this paper, we further extend this theory by characterizing the largest nonlinear almost-metric betweennesses that satisfy certain hereditary properties, as well as the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems
