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

DOI10.1016/J.DAM.2015.07.039zbMATH Open1339.05311OpenAlexW2217170363WikidataQ123220178 ScholiaQ123220178MaRDI QIDQ298972FDOQ298972

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

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

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)

Cites Work

• 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\)
• Title not available (Why is that?)
• 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

Cited In (11)

• On the strong path partition conjecture of Berge
• The directed path partition conjecture
• On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
• On the Berge's strong path partition conjecture
• Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
• Berge's conjecture on directed path partitions -- a survey
• Stable set meeting every longest path
• Title not available (Why is that?)
• On greene's theorem for digraphs
• Proof of Berge's strong path partition conjecture for \(k=2\)
• On Linial's conjecture for spine digraphs

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)