On the heapability of finite partial orders

János Balogh, Cosmin Bonchiş, Diana Diniş +2

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, whic…