English
Related papers

Related papers: Zero-sum flows for Steiner systems

200 papers

Given a $2$-$(v,k,\lambda)$ design, $\cal{S}=(X,\cal{B})$, a {\it zero-sum $n$-flow} of $\cal{S}$ is a map $f: \cal{B} \longrightarrow \{\pm 1, \ldots ,\pm (n-1)\}$ such that for any point $x\in X$, the sum of $f$ around all the blocks…

Combinatorics · Mathematics 2015-05-13 S. Akbari , A. C. Burgess , P. Danziger , E. Mendelsohn

Let $G$ be a graph. A zero-sum flow in $G$ is an assignment of nonzero real number to the edges such that the sum of the values of all edges incident with each vertex is zero. Let $k$ be naturel number. A zero-sum $k$-flow is a flow with…

Combinatorics · Mathematics 2015-03-13 S. Akbari , N. Ghareghani , G. B. Khosrovshahi , S. Zare

Let $G$ be a graph. A zero-sum flow of $G$ is an assignment of non-zero real numbers to the edges of $G$ such that the sum of the values of all edges incident with each vertex is zero. Let $k$ be a natural number. A zero-sum $k$-flow is a…

Combinatorics · Mathematics 2016-01-29 Fan Yang , Xiangwen Li

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

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

Let G=(V,E) be a simple undirected graph. For a given set L of the real line, a function omega from E to L is called an L-flow. Given a vector gamma whose coordinates are indexed by V, we say that omega is a gamma-L-flow if for each v in V,…

Combinatorics · Mathematics 2015-03-25 S. Akbari , S. Friedland , K. Markström , S. Zare

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

A circular nowhere-zero $r$-flow on a bridgeless graph $G$ is an orientation of the edges and an assignment of real values from $[1, r-1]$ to the edges in such a way that the sum of incoming values equals the sum of outgoing values for…

Combinatorics · Mathematics 2021-09-08 Robert Lukoťka

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

In this article we introduce the flow polynomial of a digraph and use it to study nowhere-zero flows from a commutative algebraic perspective. Using Hilbert's Nullstellensatz, we establish a relation between nowhere-zero flows and dual…

Combinatorics · Mathematics 2007-05-23 Shmuel Onn

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

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

This paper elucidates the connection between stationary symmetric alpha-stable processes with 0<alpha<2 and nonsingular flows on measure spaces by describing a new and unique decomposition of stationary stable processes into those…

Probability · Mathematics 2007-05-23 Gennady Samorodnitsky

In 1983, Bouchet conjectured that every flow-admissible signed graph admits a nowhere-zero $6$-flow. In this paper, we prove that Bouchet's conjecture holds for all signed ladders, circular and M\"obius ladders. In fact, all signed ladders,…

Combinatorics · Mathematics 2025-10-03 Leila Parsaei-Majd

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

If a linear combination of k smooth vector fields is zero at a point, then, generically, near this point there are small cycles comprised of segments from the flow of each vector field. This answers a question posed in arXiv:math/0504365.

Classical Analysis and ODEs · Mathematics 2008-03-28 Stewart D. Johnson

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

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

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

Let $G$ be a bridgeless cubic graph, and $\mu_2(G)$ the minimum number $k$ such that two 1-factors of $G$ intersect in $k$ edges. A cyclically $n$-edge-connected cubic graph $G$ has a nowhere-zero 5-flow if (1) $n \geq 6$ and $\mu_2(G) \leq…

Combinatorics · Mathematics 2016-09-05 Eckhard Steffen
‹ Prev 1 2 3 10 Next ›