✦ LIBER ✦

Spanning a strong digraph byαcircuits: A proof of Gallai’s conjecture

✍ Scribed by Stéphane Bessy; Stéphan Thomassé

Book ID: 106167636
Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 164 KB
Volume: 27
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-007-2073-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering a Strong Digraph by α−1 Disjoin

Covering a Strong Digraph by α−1 Disjoint Paths: A Proof of Las Vergnas' Conjecture

✍ Stéphan Thomassé 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 83 KB

The Gallai Milgram theorem states that every directed graph D is spanned by :(D) disjoint directed paths, where :(D) is the size of a largest stable set of D. When :(D)>1 and D is strongly connected, it has been conjectured by Las Vergnas that D is spanned by an arborescence with :(D)&1 leaves. The

A proof of Connelly's conjecture on 3-co

A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid

✍ Alex R Berg; Tibor Jordán 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Proof of a conjecture by Erdős and Graha

Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius

✍ Jacques Dixmier 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 487 KB