Proof of Berge's path partition conjecture for k - 3

DOI10.1016/J.DAM.2015.07.039MaRDI QIDQ298972zbMATH OpenOpenAlexWikidataFDO

Authors Dávid Herskovics

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

zbMATH Keywords

directed graphpath partitionBerge's path partition conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Proof of Berge's strong path partition conjecture for \(k=2\)
• On the strong path partition conjecture of Berge
• On the Berge's strong path partition conjecture
• Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
• The Path Partition Conjecture is true for some generalizations of tournaments

Cites work

• scientific article; zbMATH DE number 3165195 (Why is no real title available?)
• A short proof of the existence of k-saturated partitions of partially ordered sets
• A unified approach to known and unknown cases of Berge's conjecture
• Extending the Greene-Kleitman theorem to directed graphs
• Nombre chromatique et plus longs chemins d'un graphe
• Path Partitions, Cycle Covers and Integer Decomposition
• Proof of Berge's strong path partition conjecture for \(k=2\)
• The structure of Sperner k-families
• k-optimal partitions of a directed graph

Cited in

(14)

• The directed path partition conjecture
• On the Berge's strong path partition conjecture
• Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
• The Path Partition Conjecture is true for some generalizations of tournaments
• A unified approach to known and unknown cases of Berge's conjecture
• On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
• scientific article; zbMATH DE number 3889553 (Why is no real title available?)
• Proof of Berge's strong path partition conjecture for \(k=2\)
• Stable set meeting every longest path
• On greene's theorem for digraphs
• On the strong path partition conjecture of Berge
• Berge's conjecture on directed path partitions -- a survey
• On Linial's conjecture for spine digraphs
• Some results on Berge's conjecture and begin-end conjecture

This page was built for publication: Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298972)