Packing six T-joins in plane graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10329884" target="_blank" >RIV/00216208:11320/16:10329884 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jctb.2015.09.002" target="_blank" >http://dx.doi.org/10.1016/j.jctb.2015.09.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2015.09.002" target="_blank" >10.1016/j.jctb.2015.09.002</a>

Result language
angličtina
Original language name
Packing six T-joins in plane graphs
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)