Berge's conjecture on directed path partitions - a survey

Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for partially ordered sets. The conjecture relates path partitions to a collection of k independent sets, for

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Irith Ben-Arroyo Hartman
• Keywords: Conjecture, DM 2006, Partially Ordered Sets, Path Partitions