Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
From MaRDI portal
Publication:298972
DOI10.1016/j.dam.2015.07.039zbMath1339.05311OpenAlexW2217170363WikidataQ123220178 ScholiaQ123220178MaRDI QIDQ298972
Publication date: 21 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.039
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
On Linial's conjecture for spine digraphs ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
Cites Work
- Unnamed Item
- A short proof of the existence of k-saturated partitions of partially ordered sets
- Extending the Greene-Kleitman theorem to directed graphs
- k-optimal partitions of a directed graph
- Proof of Berge's strong path partition conjecture for \(k=2\)
- Path Partitions, Cycle Covers and Integer Decomposition
- A unified approach to known and unknown cases of Berge's conjecture
- Nombre chromatique et plus longs chemins d'un graphe
- The structure of Sperner k-families
This page was built for publication: Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
