Median graphs, parallelism and posets

Abstract

A notion of parallelism is defined in finite median graphs and a number of properties about geodesics and the existence of cubes are obtained. Introducing sites as a double structure of partial order and graph on a set, it is shown that all median graphs can be constructed from sites and, in fact, that the categories of sites and pointed median graphs are equivalent, generalizing Birkhoff's duality.