English
Related papers

Related papers: Flows on signed graphs without long barbells

200 papers

In 1983, A. Bouchet extended W.T. Tutte's notion of nowhere-zero flows to signed graphs, and conjectured that every flow-admissible signed graph has a nowhere-zero 6-flow. In this paper we prove that every flow-admissible signed graph that…

Combinatorics · Mathematics 2025-12-23 Matt DeVos , Kathryn Nurse , Robert Šámal

We prove that a signed graph admits a nowhere-zero $8$-flow provided that it is flow-admissible and the underlying graph admits a nowhere-zero $4$-flow. When combined with the 4-color theorem, this implies that every flow-admissible…

Combinatorics · Mathematics 2024-02-21 Rong Luo , Edita Máčajová , Martin Škoviera , Cun-Quan Zhang

In 1954, Tutte conjectured that every bridgeless graph has a nowhere-zero 5-flow. Let $\omega$ be the minimum number of odd cycles in a 2-factor of a bridgeless cubic graph. Tutte's conjecture is equivalent to its restriction to cubic…

Combinatorics · Mathematics 2012-09-21 Eckhard Steffen

The presented paper studies the flow number $F(G,\sigma)$ of flow-admissible signed graphs $(G,\sigma)$ with two negative edges. We restrict our study to cubic graphs, because for each non-cubic signed graph $(G,\sigma)$ there is a set…

Combinatorics · Mathematics 2016-04-28 Edita Rollová , Michael Schubert , Eckhard Steffen

We generalize Tutte's integer flows and the $d$-dimensional Euclidean flows of Mattiolo, Mazzuoccolo, Rajn\'{i}k, and Tabarelli to \emph{$d$-dimensional $p$-normed nowhere-zero flows} and define the corresponding flow index $\phi_{d,p}(G)$…

Combinatorics · Mathematics 2026-01-21 Chenxing Li , Jiaao Li , Rong Luo , Bo Su

Tutte's famous 5-flow conjecture asserts that every bridgeless graph has a nowhere-zero 5-flow. Seymour proved that every such graph has a nowhere-zero 6-flow. Here we give (two versions of) a new proof of Seymour's Theorem. Both are…

Combinatorics · Mathematics 2015-12-22 Matt DeVos , Edita Rollová , Robert Šámal

Tutte's 3-flow conjecture asserts that every 4-edge-connected graph has a nowhere-zero 3-flow. In this note we prove that every regular graph of valency at least four admitting a solvable arc-transitive group of automorphisms admits a…

Combinatorics · Mathematics 2014-05-27 Xiangwen Li , Sanming Zhou

The study of nowhere-zero flows began with a key observation of Tutte that in planar graphs, nowhere-zero k-flows are dual to k-colourings (in the form of k-tensions). Tutte conjectured that every graph without a cut-edge has a nowhere-zero…

Combinatorics · Mathematics 2013-11-01 Matt DeVos

We generalise to signed graphs a classical result of Tutte [Canad. J. Math. 8 (1956), 13--28] stating that every integer flow can be expressed as a sum of characteristic flows of circuits. In our generalisation, the r\^ole of circuits is…

Combinatorics · Mathematics 2014-07-22 Edita Macajova , Martin Skoviera

A nowhere-zero $k$-flow on a graph $\Gamma$ is a mapping from the edges of $\Gamma$ to the set $\{\pm1, \pm2, ..., \pm(k-1)\} \subset \bbZ$ such that, in any fixed orientation of $\Gamma$, at each node the sum of the labels over the edges…

Combinatorics · Mathematics 2007-05-25 Matthias Beck , Thomas Zaslavsky

In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero $6$-flow. Bouchet himself proved that such signed graphs admit nowhere-zero $216$-flows and Zyka further proved that such signed graphs…

Combinatorics · Mathematics 2019-08-30 Matt DeVos , Jiaao Li , You Lu , Rong Luo , Cun-Quan Zhang , Zhang Zhang

We study the flow spectrum ${\cal S}(G)$ and the integer flow spectrum $\overline{{\cal S}}(G)$ of signed $(2t+1)$-regular graphs. We show that if $r \in {\cal S}(G)$, then $r = 2+\frac{1}{t}$ or $r \geq 2 + \frac{2}{2t-1}$. Furthermore, $2…

Combinatorics · Mathematics 2015-09-22 Michael Schubert , Eckhard Steffen

Tutte's $3$-flow conjecture states that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. In this paper, we characterize all graphs with independence number at most $4$ that admit a nowhere-zero $3$-flow. The characterization…

Combinatorics · Mathematics 2017-07-24 Jiaao Li , Rong Luo , Yi Wang

Tutte's 5-Flow Conjecture from 1954 states that every bridgeless graph has a nowhere-zero 5-flow. In 2004, Kochol proved that the conjecture is equivalent to its restriction on cyclically 6-edge connected cubic graphs. We prove that every…

Combinatorics · Mathematics 2014-12-18 Giuseppe Mazzuoccolo , Eckhard Steffen

Bouchet conjectured in 1983 that every flow-admissible signed graph admits a nowhere-zero 6-flow which is equivalent to the restriction to cubic signed graphs. In this paper, we proved that every flow-admissible $3$-edge-colorable cubic…

Combinatorics · Mathematics 2022-11-04 Liangchen Li , Chong Li , Rong Luo , C. -Q Zhang , Hailing Zhang

In 1983, Bouchet conjectured that every flow-admissible signed graph admits a nowhere-zero 6-flow. We verify this conjecture for the class of flow-admissible signed graphs possessing a spanning even Eulerian subgraph, which includes as a…

Combinatorics · Mathematics 2025-10-10 Chao Wen , Qiang Sun , Chao Zhang

Tutte initiated the study of nowhere-zero flows and proved the following fundamental theorem: For every graph $G$ there is a polynomial $f$ so that for every abelian group $\Gamma$ of order $n$, the number of nowhere-zero $\Gamma$-flows in…

Combinatorics · Mathematics 2017-01-26 Matt DeVos , Edita Rollová , Robert Šámal

Tutte's 3-flow conjecture asserts that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. We prove that this conjecture is true for every Cayley graph of valency at least four on any supersolvable group with a noncyclic Sylow…

Combinatorics · Mathematics 2022-03-08 Junyang Zhang , Sanming Zhou

This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We generalise the well-known fact about the existence of nowhere-zero $2$-flows in eulerian graphs by proving that every signed eulerian graph that…

Combinatorics · Mathematics 2016-07-04 Edita Máčajová , Martin Škoviera

Bouchet conjectured in 1983 that each signed graph that admits a nowhere-zero flow has a nowhere-zero 6-flow. We prove that the conjecture is true for all signed series-parallel graphs. Unlike the unsigned case, the restriction to…

Combinatorics · Mathematics 2014-11-10 Tomáš Kaiser , Edita Rollová
‹ Prev 1 2 3 10 Next ›