English
Related papers

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

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

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 1972, Tutte posed the $3$-Flow Conjecture: that all $4$-edge-connected graphs have a nowhere zero $3$-flow. This was extended by Jaeger et al.(1992) to allow vertices to have a prescribed, possibly non-zero difference (modulo $3$)…

Combinatorics · Mathematics 2020-11-05 Jamie V. de Jong

Identities obtained by elementary finite Fourier analysis are used to derive a variety of evaluations of the Tutte polynomial of a graph G at certain points (a,b) where (a-1)(b-1) equals 2 or 4. These evaluations are expressed in terms of…

Combinatorics · Mathematics 2007-09-20 Andrew J. Goodall

Converting modulo flows into integer-valued flows is one of the most critical steps in the study of integer flows. Tutte and Jaeger's pioneering work shows the equivalence of modulo flows and integer-valued flows for ordinary graphs.…

Combinatorics · Mathematics 2017-05-01 Jian Cheng , You Lu , Rong Luo , Cun-Quan Zhang

Let $\Gamma$ be a multigraph with for each vertex a cyclic order of the edges incident with it. For $n \geq 3$, let $D_{2n}$ be the dihedral group of order $2n$. Define $\mathbb{D} := \{(\begin{smallmatrix} 1 & a \\ 0 & 1 \end{smallmatrix})…

Combinatorics · Mathematics 2018-12-04 Bart Litjens

In contrast to ordinary graphs, the number of the nowhere-zero group-flows in a signed graph may vary with different groups, even if the groups have the same order. In fact, for a signed graph $G$ and non-negative integer $d$, it was shown…

Combinatorics · Mathematics 2018-06-26 Jianguo Qian

We prove that, in several settings, a graph has exponentially many nowhere-zero flows. These results may be seen as a counting alternative to the well-known proofs of existence of $Z_3$-, $Z_4$-, and $Z_6$-flows. In the dual setting,…

Combinatorics · Mathematics 2019-04-09 Zdeněk Dvořák , Bojan Mohar , Robert Šámal

X. Hou, H.-J. Lai, P. Li and C.-Q. Zhang [J. Graph Theory 69 (2012) 464-470] showed that for a simple graph $G$ with $|V(G)|\ge 44$, if $\min\{\delta(G),\delta(G^c)\}\ge 4$, then either $G$ or its complementary graph $G^c$ has a…

Combinatorics · Mathematics 2019-03-15 Jiaao Li , Xueliang Li , Meiling Wang

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

The number of nowhere zero Z_Q flows on a graph G can be shown to be a polynomial in Q, defining the flow polynomial \Phi_G(Q). According to Tutte's five-flow conjecture, \Phi_G(5) > 0 for any bridgeless G.A conjecture by Welsh that…

Combinatorics · Mathematics 2015-10-07 Jesper L. Jacobsen , Jesus Salas

For integers $a\ge 2b>0$, a \emph{circular $a/b$-flow} is a flow that takes values from $\{\pm b, \pm(b+1), \dots, \pm(a-b)\}$. The Planar Circular Flow Conjecture states that every $2k$-edge-connected planar graph admits a circular…

Combinatorics · Mathematics 2020-07-14 Daniel W. Cranston , Jiaao Li

A problem by Diestel is to extend algebraic flow theory of finite graphs to infinite graphs with ends. In order to pursue this problem, we define an A-flow and non-elusive H-flow for arbitrary graphs and for abelian topological Hausdorff…

Combinatorics · Mathematics 2016-12-26 Babak Miraftab , Javad Moghadamzadeh

We show that for every non-elementary hyperbolic group, an associated topological flow space admits a coding based on a transitive subshift of finite type. Applications include regularity results for Manhattan curves, the uniqueness of…

Dynamical Systems · Mathematics 2024-03-19 Stephen Cantrell , Ryokichi Tanaka

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

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

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

In this paper, we consider the high order geometric flows of a submanifolds $M$ in a complete Riemannian manifold $N$ with $\dim(N)=\dim(M)+1=n+1$, which were introduced by Mantegazza in the case the ambient space is an Euclidean space, and…

Differential Geometry · Mathematics 2019-08-23 Zonglin Jia , Youde Wang

There is a common description of different intrinsic geometric flows in two dimensions using Toda field equations associated to continual Lie algebras that incorporate the deformation variable t into their system. The Ricci flow admits zero…

High Energy Physics - Theory · Physics 2009-11-11 I. Bakas

This article studies real roots of the flow polynomial $F(G,\lambda)$ of a bridgeless graph $G$. For any integer $k\ge 0$, let $\xi_k$ be the supremum in $(1,2]$ such that $F(G,\lambda)$ has no real roots in $(1,\xi_k)$ for all graphs $G$…

Combinatorics · Mathematics 2014-03-11 Fengming Dong