{"title":"Another proof of Seymour's 6-flow theorem","authors":"Matt DeVos, Jessica McDonald, Kathryn Nurse","doi":"10.1002/jgt.23091","DOIUrl":null,"url":null,"abstract":"<p>In 1981 Seymour proved his famous 6-flow theorem asserting that every 2-edge-connected graph has a nowhere-zero flow in the group <span></span><math>\n \n <mrow>\n <msub>\n <mi>Z</mi>\n \n <mn>2</mn>\n </msub>\n \n <mo>×</mo>\n \n <msub>\n <mi>Z</mi>\n \n <mn>3</mn>\n </msub>\n </mrow></math> (in fact, he offers two proofs of this result). In this note, we give a new short proof of a generalization of this theorem where <span></span><math>\n \n <mrow>\n <msub>\n <mi>Z</mi>\n \n <mn>2</mn>\n </msub>\n \n <mo>×</mo>\n \n <msub>\n <mi>Z</mi>\n \n <mn>3</mn>\n </msub>\n </mrow></math>-valued functions are found subject to certain boundary constraints.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"106 4","pages":"944-946"},"PeriodicalIF":0.9000,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23091","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23091","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In 1981 Seymour proved his famous 6-flow theorem asserting that every 2-edge-connected graph has a nowhere-zero flow in the group (in fact, he offers two proofs of this result). In this note, we give a new short proof of a generalization of this theorem where -valued functions are found subject to certain boundary constraints.
期刊介绍:
The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences.
A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .