In previous work, two axiomatic characterizations were given for the median function on median graphs: one involving the three simple and natural axioms anonymity, betweenness and consistency; the other involving faithfulness, consistency and [Formula: see text]-Condorcet. To date, the independence of these axioms has not been a serious point of study. The aim of this paper is to provide the missing answers. The independent subsets of these five axioms are determined precisely and examples provided in each case on arbitrary median graphs. There are three cases that stand out. Here nontrivial examples and proofs are needed to give a full answer. Extensive use of the structure of median graphs is used throughout.
From modular decomposition trees to rooted median graphs
