A short proof of Seymour's 6-flow theorem
Combinatorics
2023-07-11 v1
Abstract
We give a compact variation of Seymour's proof that every -edge-connected graph has a nowhere-zero -flow.
Cite
@article{arxiv.2307.04768,
title = {A short proof of Seymour's 6-flow theorem},
author = {Matt DeVos and Kathryn Nurse},
journal= {arXiv preprint arXiv:2307.04768},
year = {2023}
}
Comments
2 pages