Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
type: Item
instance of: scholarly article
title: Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
zbMATH Open document ID: 1339.05311
author: Dávid Herskovics
published in: Discrete Applied Mathematics
publication date: 2016-06-21T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6595956
zbMATH Keywords: directed graph
zbMATH Keywords: path partition
zbMATH Keywords: Berge's path partition conjecture
MaRDI profile type: Publication
full work available at URL: j.dam.2015.07.039
OpenAlex ID: W2217170363
cites work: k-optimal partitions of a directed graph
cites work: Proof of Berge's strong path partition conjecture for \(k=2\)
cites work: A unified approach to known and unknown cases of Berge's conjecture
cites work: Q3283482
cites work: The structure of Sperner k-families
cites work: Extending the Greene-Kleitman theorem to directed graphs
cites work: Nombre chromatique et plus longs chemins d'un graphe
cites work: A short proof of the existence of k-saturated partitions of partially ordered sets
cites work: Path Partitions, Cycle Covers and Integer Decomposition
Wikidata QID: Q123220178
DOI: 10.1016/J.DAM.2015.07.039
description: scientific article; zbMATH DE number 6595956