English
Related papers

Related papers: High-Dimensional $p$-Normed Flows

200 papers

A $d$-dimensional nowhere-zero $r$-flow on a graph $G$, an $(r,d)$-NZF from now on, is a flow where the value on each edge is an element of $\mathbb{R}^d$ whose (Euclidean) norm lies in the interval $[1,r-1]$. Such a notion is a natural…

Combinatorics · Mathematics 2023-04-28 Davide Mattiolo , Giuseppe Mazzuoccolo , Jozef Rajník , Gloria Tabarelli

Many basic properties in Tutte's flow theory for unsigned graphs do not have their counterparts for signed graphs. However, signed graphs without long barbells in many ways behave like unsigned graphs from the point view of flows. In this…

Combinatorics · Mathematics 2019-09-02 You Lu , Rong Luo , Michael Schubert , Eckhard Steffen , Cun-Quan Zhang

A $d$-dimensional nowhere-zero $r$-flow on a graph $G$, an $(r,d)$-NZF from now on, is a flow where the value on each edge is an element of $\mathbb{R}^d$ whose (Euclidean) norm lies in the interval $[1, r-1]$. Such a notion is a natural…

Combinatorics · Mathematics 2025-10-23 Davide Mattiolo , Giuseppe Mazzuoccolo , Jozef Rajník , Gloria Tabarelli

A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related…

Combinatorics · Mathematics 2026-03-25 Nikolay Ulyanov

Tutte's $3$-flow conjecture says that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. Kochol (2001) showed that it is enough to prove this conjecture for $5$-edge-connected graphs. Former, Jaeger, Linial, Payan, and Tarsi…

Combinatorics · Mathematics 2022-05-16 Morteza Hasanvand

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

We investigate multidimensional nowhere-zero flows of bridgeless graphs. By extending the established use of the Euclidean norm, this paper considers the Manhattan and Chebyshev norms, leading to the definition of the flow numbers…

Combinatorics · Mathematics 2025-10-28 Lukáš Gáborik , Sascha Kurz , Giuseppe Mazzuoccolo , Jozef Rajník , Florian Rieg

This paper concerns a generalization of nowhere-zero modular q-flows from graphs to simplicial complexes of dimension d greater than 1. A modular q-flow of a simplicial complex is an element of the kernel of the d-th boundary map with…

Combinatorics · Mathematics 2014-09-23 Bradley Lewis Burdick

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

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

Two well-known results in the world of nowhere-zero flows are Jaeger's 4-flow theorem asserting that every 4-edge-connected graph has a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}_2$-flow and Seymour's 6-flow theorem asserting that every…

Combinatorics · Mathematics 2020-05-21 Matt DeVos , Rikke Langhede , Bojan Mohar , Robert Šámal

A function $f:N\rightarrow N$ is sublinear, if \[\lim_{x\rightarrow +\infty}\frac{f(x)}{x}=0.\] If $A$ is an Abelian group, $G$ is a graph and $\phi$ is an $A$-flow in $G$, then let $N(\phi)$ be the nullity of $\phi$, that is, the set of…

Discrete Mathematics · Computer Science 2020-10-08 Vahan Mkrtchyan

Let $r \geq 2$ be a real number. A complex nowhere-zero $r$-flow on a graph $G$ is an orientation of $G$ together with an assignment $\varphi\colon E(G)\to \mathbb{C}$ such that, for all $e \in E(G)$, the modulus of the complex number…

Combinatorics · Mathematics 2023-03-21 Davide Mattiolo , Giuseppe Mazzuoccolo , Jozef Rajník , Gloria Tabarelli

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

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

Let $\Gamma$ be a graph, $A$ an abelian group, $\mathcal{D}$ a given orientation of $\Gamma$ and $R$ a unital subring of the endomorphism ring of $A$. It is shown that the set of all maps $\varphi$ from $E(\Gamma)$ to $A$ such that…

Combinatorics · Mathematics 2021-11-16 Jun-Yang Zhang , Na Lu

There are many major open problems in integer flow theory, such as Tutte's 3-flow conjecture that every 4-edge-connected graph admits a nowhere-zero 3-flow, Jaeger et al.'s conjecture that every 5-edge-connected graph is $Z_3$-connected and…

Combinatorics · Mathematics 2015-07-13 Fuyuan Chen , Bo Ning

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

We study $2$-dimensional unit vector flows on graphs, that is, nowhere-zero flows that assign to each oriented edge a unit vector in $\mathbb R^{3}$. We give a new geometric characterization of $\mathbb S^{2}$-flows on cubic graphs. We also…

Combinatorics · Mathematics 2026-02-26 Hussein Houdrouge , Bobby Miraftab , Pat Morin

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
‹ Prev 1 2 3 10 Next ›