An axiomatic characterization using splitting and merging in combinatorial species shows that MAT-labeled complete graphs, regular vines, and maximal Arrow single-peaked domains share the same recursive structure, with regular vines also equivalent to (n,3)-extremal lattices.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An axiomatic framework from splitting and merging in MAT-labeled graphs, vines, and single-peaked domains
An axiomatic characterization using splitting and merging in combinatorial species shows that MAT-labeled complete graphs, regular vines, and maximal Arrow single-peaked domains share the same recursive structure, with regular vines also equivalent to (n,3)-extremal lattices.