2025/10/10 by Ben Adenbaum, Adenbaum, Ben, Emily Barnard +11
Computer Science · Mathematics · #05E99 #06A07 #06B10 #52B05 #Advanced Algebra and Logic #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2510.09429
openalex publication_date 2025/10/10 · openalex created_date 2025/10/14 · openalex updated_date 2026/07/28
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.