1 research outputs found

    Nowhere-zero flows on signed regular graphs

    Full text link
    We study the flow spectrum S(G){\cal S}(G) and the integer flow spectrum Sβ€Ύ(G)\overline{{\cal S}}(G) of signed (2t+1)(2t+1)-regular graphs. We show that if r∈S(G)r \in {\cal S}(G), then r=2+1tr = 2+\frac{1}{t} or rβ‰₯2+22tβˆ’1r \geq 2 + \frac{2}{2t-1}. Furthermore, 2+1t∈S(G)2 + \frac{1}{t} \in {\cal S}(G) if and only if GG has a tt-factor. If GG has a 1-factor, then 3∈Sβ€Ύ(G)3 \in \overline{{\cal S}}(G), and for every tβ‰₯2t \geq 2, there is a signed (2t+1)(2t+1)-regular graph (H,Οƒ)(H,\sigma) with 3∈Sβ€Ύ(H) 3 \in \overline{{\cal S}}(H) and HH does not have a 1-factor. If GG (=ΜΈK23)(\not = K_2^3) is a cubic graph which has a 1-factor, then {3,4}βŠ†S(G)∩Sβ€Ύ(G)\{3,4\} \subseteq {\cal S}(G) \cap \overline{{\cal S}}(G). Furthermore, the following four statements are equivalent: (1) GG has a 1-factor. (2) 3∈S(G)3 \in {\cal S}(G). (3) 3∈Sβ€Ύ(G)3 \in \overline{{\cal S}}(G). (4) 4∈Sβ€Ύ(G)4 \in \overline{{\cal S}}(G). There are cubic graphs whose integer flow spectrum does not contain 5 or 6, and we construct an infinite family of bridgeless cubic graphs with integer flow spectrum {3,4,6}\{3,4,6\}. We show that there are signed graphs where the difference between the integer flow number and the flow number is greater than or equal to 1, disproving a conjecture of Raspaud and Zhu. The paper concludes with a proof of Bouchet's 6-flow conjecture for Kotzig-graphs.Comment: 24 pages, 4 figures; final version; to appear in European J. Combinatoric
    corecore