A new proof of Seymour's 6-flow theorem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10332610" target="_blank" >RIV/00216208:11320/17:10332610 - isvavai.cz</a>
Alternative codes found
RIV/49777513:23520/17:43931176
Result on the web
<a href="http://dx.doi.org/10.1016/j.jctb.2016.05.010" target="_blank" >http://dx.doi.org/10.1016/j.jctb.2016.05.010</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2016.05.010" target="_blank" >10.1016/j.jctb.2016.05.010</a>
Alternative languages
Result language
angličtina
Original language name
A new proof of Seymour's 6-flow theorem
Original language description
Tutte's famous 5-flow conjecture asserts that every bridgeless graph has a nowhere-zero 5-flow. Seymour proved that every such graph has a nowhere-zero 6-flow. Here we give (two versions of) a new proof of Seymour's Theorem. Both are roughly equal to Seymour's in terms of complexity, but they offer an alternative perspective which we hope will be of value.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
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)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Combinatorial Theory. Series B
ISSN
0095-8956
e-ISSN
—
Volume of the periodical
122
Issue of the periodical within the volume
January 2017
Country of publishing house
US - UNITED STATES
Number of pages
9
Pages from-to
187-195
UT code for WoS article
000389788300010
EID of the result in the Scopus database
—