Back to search

West Virginia University

Integer flows and Modulo Orientations

Abstract

dc:description.abstract

Tutte's 3-flow conjecture (1970's) states that every 4-edge-connected graph admits a nowhere-zero 3-flow. A graph G admits a nowhere-zero 3-flow if and only if G has an orientation such that the out-degree equals the in-degree modulo 3 for every vertex. In the 1980ies Jaeger suggested some related conjectures. The generalized conjecture to modulo k-orientations, called circular flow conjecture, says that, for every odd natural number k, every (2k-2)-edge-connected graph has an orientation such that the out-degree equals the in-degree modulo k for every vertex. And the weaker conjecture he made, known as the weak 3-flow conjecture where he suggests that the constant 4 is replaced by any larger constant.;The weak version of the circular flow conjecture and the weak 3-flow conjecture are verified by Thomassen (JCTB 2012) recently. He proved that, for every odd natural number k, every (2k 2 + k)-edge-connected graph has an orientation such that the out-degree equals the in-degree modulo k for every vertex and for k = 3 the edge-connectivity 8 suffices. Those proofs are refined in this paper to give the same conclusions for 9 k-edge-connected graphs and for 6-edge-connected graphs when k = 3 respectively.

Degree

thesis:*
Name thesis:degree_name
PhD
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wu, Yezhou

Subjects

dc:subject × 1

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
West Virginia University
Base URL
researchrepository.wvu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Wu, Yezhou. Integer flows and Modulo Orientations. Dissertation thesis, https://doi.org/10.33915/etd.3566