✦ LIBER ✦
One or Two Disjoint Circuits Cover Independent Edges: Lovász–Woodall Conjecture
✍ Scribed by Ken-ichi Kawarabayashi
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 408 KB
- Volume
- 84
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, we prove the following theorem: Let L be a set of k independent edges in a k-connected graph G. If k is even or G -L is connected, then there exist one or two disjoint circuits containing all the edges in L. This theorem is the first step in the proof of the conjecture of L.