The poset of maximal tubings of the cycle graph is a lattice

Abstract

The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path graph, respectively. It is an open problem to characterize graphs for which the poset of maximal tubings is a lattice. In this paper, we prove that the poset of maximal tubings for the cycle graph is a lattice, and moreover that it is semidistributive and congruence uniform. As main tools, we characterize all order relations in the poset, and introduce a useful map from maximal tubings of the cycle graph to maximal tubings of the path graph.