Question

Prove that every comparability graph is perfect.​

Answer 1

Answer:

please mark as brainlist answer

Step-by-step explanation:

Every comparability graph is perfect. The perfection of comparability graphs is Mirsky's theorem, and the perfection of their complements is Dilworth's theorem; these facts, together with the perfect graph theorem can be used to prove Dilworth's theorem from Mirsky's theorem or vice versa.