Abstract

In this note, we prove that the comparability graph of a posetP has less edges than that of a posetQ on the same set of elements, thenP has more linear extensions thanQ. This solves a problem posed by Kelly [1].

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call