Packing six T-joins in plane graphs
Combinatorics
2014-04-25 v3
Abstract
Let G be a plane graph and T an even subset of its vertices. It has been conjectured that if all T-cuts of G have the same parity and the size of every T-cut is at least k, then G contains k edge-disjoint T-joins. The case k=3 is equivalent to the Four Color Theorem, and the cases k=4, which was conjectured by Seymour, and k=5 were proved by Guenin. We settle the next open case k=6.
Cite
@article{arxiv.1009.5912,
title = {Packing six T-joins in plane graphs},
author = {Zdenek Dvorak and Ken-ichi Kawarabayashi and Daniel Kral},
journal= {arXiv preprint arXiv:1009.5912},
year = {2014}
}