2000 character limit reached
Nowhere-zero 8-flows in cyclically 5-edge-connected, flow-admissible signed graphs
Published 1 Sep 2023 in math.CO | (2309.00704v1)
Abstract: In 1983, Bouchet proved that every bidirected graph with a nowhere-zero integer-flow has a nowhere-zero 216-flow, and conjectured that 216 could be replaced with 6. This paper shows that for cyclically 5-edge-connected bidirected graphs that number can be replaced with 8.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.