Geodesic
A short proof of Seymour's 6-flow theorem
Matt DeVos1 ; Kathryn Nurse2
1Simon Fraser University
2École Normale Supérieure
The electronic journal of combinatorics, Tome 32 (2025) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We give a compact variation of Seymour's proof that every $2$-edge-connected graph has a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}_3$-flow.
DOI : 10.37236/14483
Classification : 05C21

Matt DeVos  1   ; Kathryn Nurse  2

1 Simon Fraser University
2 École Normale Supérieure 
@article{10_37236_14483,
     author = {Matt DeVos and Kathryn Nurse},
     title = {A short proof of {Seymour's} 6-flow theorem},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {4},
     doi = {10.37236/14483},
     zbl = {8120099},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/14483/}
}
TY  - JOUR
AU  - Matt DeVos
AU  - Kathryn Nurse
TI  - A short proof of Seymour's 6-flow theorem
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/14483/
DO  - 10.37236/14483
ID  - 10_37236_14483
ER  - 
%0 Journal Article
%A Matt DeVos
%A Kathryn Nurse
%T A short proof of Seymour's 6-flow theorem
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/14483/
%R 10.37236/14483
%F 10_37236_14483
Matt DeVos; Kathryn Nurse. A short proof of Seymour's 6-flow theorem. The electronic journal of combinatorics, Tome 32 (2025) no. 4. doi: 10.37236/14483

Cité par Sources :