A combinatorial bijection between linear extensions of equivalent orders

Abstract

Let P and Q be (partially) ordered sets with the same comparability graph. A bijection is constructed between the sets of linear extensions of P and Q such that the number of setups is preserved. This yields a common generalization of the comparability invariance of order dimension, setup number and number of linear extensions.