Circular flow number of highly edge connected signed graphs
Abstract
This paper proves that for any positive integer k, every essentially (2k+1)-unbalanced (12k-1)-edge connected signed graph has circular flow number at most 2+ 1k.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.