Abstract
Berge’s strong path partition conjecture from 1982 generalizes and extends Dilworth’s theorem and the Greene–Kleitman theorem which are well known for partially ordered sets. The conjecture is known to be true for all digraphs only for k = 1 (by the Gallai–Milgram theorem) and for k ≥ λ (where λ is the cardinality of the longest path in the graph). The attempts made, so far, to prove the conjecture for other values of k have yielded proofs for acyclic digraphs, but not for general digraphs. In this paper, we prove the conjecture for k = 2 for all digraphs. The proof is constructive and it extends the proof for k = 1 .
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
