Planar graded lattices and the \(c_1\)-median property (Q304195)

The \textit{covering graph} of a poset has as its vertices the elements of the poset, with two vertices adjacent if one covers the other in the poset. A lattice is \textit{planar} if its covering graph is a planar graph. Given elements \(x_1, x_2, \ldots, x_k\) of a lattice \(L\), \(y\in L\) is called a \textit{median} of the \(x_i\)'s provided that \(y\) minimizes the sum over \(i\) of the distance to \(x_i\), where the ``distance'' is the shortest path distance in the covering graph of \(L\). The function \(c_1\) is simply the join of its arguments: \(c_1(x_1, \ldots, x_k) = x_1\vee \dots \vee x_k\). The lattice \(L\) has the \textit{\(c_1\)-median property} provided that, for each median \(y\), it is true that \(y\leq c_1(x_1,\ldots, x_k)\). The main result considers (finite) planar, graded lattices, yielding that these lattices satisfy the \(c_1\)-median property.