Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\) (Q298972): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q123220178, #quickstatements; #temporary_batch_1722355380754
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: k-optimal partitions of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Berge's strong path partition conjecture for \(k=2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to known and unknown cases of Berge's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3283482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of Sperner k-families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the Greene-Kleitman theorem to directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre chromatique et plus longs chemins d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the existence of k-saturated partitions of partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Partitions, Cycle Covers and Integer Decomposition / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123220178 / rank
 
Normal rank

Latest revision as of 17:03, 30 July 2024

scientific article
Language Label Description Also known as
English
Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
scientific article

    Statements

    Identifiers