The convex weighting of a graph and an alternative definition of a matroid (Q787997)

The authors refer to an algorithm of \textit{R. N. Burns} and \textit{C. E. Haff} to find the kth best base of an element-weighted matroid [Aequationes Math. 14, 351-355 (1976; Zbl 0334.20003)]. They show that, for a given independence system which is uniform (that is, the maximal independent sets have the same cardinality), H is a matroid if and only if the Burns \& Haff algorithm works for every weighting of the underlying set. To do this, they define a convex (vertex-)weighting of a graph (such as a matroid base graph) for which the algorithm (used to get the kth best vertex) works.