English
Related papers

Related papers: A survey on the study of real zeros of flow polyno…

200 papers

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

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

Given a graph $G$, the number of nowhere-zero $\ZZ_q$-flows $\phi_G(q)$ is known to be a polynomial in $q$. We extend the definition of nowhere-zero $\ZZ_q$-flows to simplicial complexes $\Delta$ of dimension greater than one, and prove the…

Combinatorics · Mathematics 2013-10-07 Matthias Beck , Yvonne Kemper

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

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

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

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

Let $G$ be a connected graph; denote by $\tau(G)$ the set of its spanning trees. Let $\mathbb F_q$ be a finite field, $s(\alpha,G)=\sum_{T\in\tau(G)} \prod_{e \in E(T)} \alpha_e$, where ${\alpha_e\in \mathbb F_q}$. Kontsevich conjectured in…

Combinatorics · Mathematics 2017-05-12 Eduard Yu. Lerner , Andrey P. Kuptsov , Sofya A. Mukhamedjanova

Kochol introduced the assigning polynomial $F(G,\alpha;k)$ to count nowhere-zero $(A,b)$-flows of a graph $G$, where $A$ is a finite Abelian group and $\alpha$ is a $\{0,1\}$-assigning from a family $\Lambda(G)$ of certain nonempty vertex…

Combinatorics · Mathematics 2024-09-17 Houshan Fu , Xiangyu Ren , Suijie Wang

We present exact calculations of flow polynomials $F(G,q)$ for lattice strips of various fixed widths $L_y$ and arbitrarily great lengths $L_x$, with several different boundary conditions. Square, honeycomb, and triangular lattice strips…

Statistical Mechanics · Physics 2007-05-23 Shu-Chiuan Chang , Robert Shrock

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

The chromatic polynomial P_G(q) of a loopless graph G is known to be nonzero (with explicitly known sign) on the intervals (-\infty,0), (0,1) and (1,32/27]. Analogous theorems hold for the flow polynomial of bridgeless graphs and for the…

Combinatorics · Mathematics 2009-11-16 Bill Jackson , Alan D. Sokal

We introduce and study a multivariate function that counts nowhere-zero flows on a graph G, in which each edge of G has an individual capacity. We prove that the associated counting function is a piecewise-defined polynomial in these…

Combinatorics · Mathematics 2016-05-10 Matthias Beck , Alyssa Cuyjet , Gordon Rojas Kirby , Molly Stubblefield , Michael Young

Let $G$ be a bridgeless graph. In 2011 Kung and Royle showed that all roots of the flow polynomial $F(G,\lambda)$ of $G$ are integers if and only if $G$ is the dual of a chordal and plane graph. In this article, we study whether a…

Combinatorics · Mathematics 2018-08-02 Fengming Dong

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

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

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

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