English
Related papers

Related papers: Flow polynomials as Feynman amplitudes and their $…

200 papers

Tutte conjectured in 1972 that every 4-edge connected graph has a nowhere-zero 3-flow. This has long been known to be equivalent to the conjecture that every 5-regular 4-edge-connected graph has an edge orientation in which every out-degree…

Combinatorics · Mathematics 2016-08-08 Pawel Pralat , Nick Wormald

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 provide a homological algebraic realization of the lattices of integer cuts and integer flows of graphs. To a finite 2-edge-connected graph $\Gamma$ with a spanning tree $T$, we associate a finite dimensional Koszul algebra…

Combinatorics · Mathematics 2019-05-29 Zsuzsanna Dancso , Anthony M. Licata

We show that the dual graph of the triangulation of the flow polytope of the zigzag graph adorned with the length-reverse-length framing is a subgraph of a grid graph. Through M\'esz\'aros, Morales, and Striker's bijection between simplices…

Combinatorics · Mathematics 2024-07-01 Rachel Brunner , Christopher R. H. Hanusa

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

Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…

Combinatorics · Mathematics 2017-03-03 T. Kotek , J. A. Makowsky , E. V. Ravve

We prove several theorems concerning Tutte polynomials $T(G,x,y)$ for recursive families of graphs. In addition to its interest in mathematics, the Tutte polynomial is equivalent to an important function in statistical physics, the Potts…

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

Let $S,T$ be two distinct finite Abelian groups with $|S|=|T|$. A fundamental theorem of Tutte shows that a graph admits a nowhere-zero $S$-flow if and only if it admits a nowhere-zero $T$-flow. Jaeger, Linial, Payan and Tarsi in 1992…

Combinatorics · Mathematics 2020-09-16 Miaomiao Han , Jiaao Li , Xueliang Li , Meiling Wang

Let $e$ be a positive integer, $p$ be an odd prime, $q=p^{e}$, and $\Bbb F_q$ be the finite field of $q$ elements. Let $f,g \in \Bbb F_q [X,Y]$. The graph $G=G_q(f,g)$ is a bipartite graph with vertex partitions $P=\Bbb F_q^3$ and $L=\Bbb…

Combinatorics · Mathematics 2015-07-21 Xiang-dong Hou , Stephen D. Lappano , Felix Lazebnik

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 famous and wide-open problem, going back to at least the early 1970's, concerns the classification of chromatic polynomials of graphs. Toward this classification problem, one may ask for necessary inequalities among the coefficients of a…

Combinatorics · Mathematics 2021-12-21 Matthias Beck , Emerson Leon

Generalizing a result of Furstenberg, we show that for every infinite discrete group $G$, the Bernoulli flow $2^G$ is disjoint from every minimal $G$-flow. From this, we deduce that the algebra generated by the minimal functions…

Dynamical Systems · Mathematics 2023-02-22 Eli Glasner , Todor Tsankov , Benjamin Weiss , Andy Zucker

The Chan-Robbins-Yuen polytope can be thought of as the flow polytope of the complete graph with netflow vector $(1, 0, \ldots, 0, -1)$. The normalized volume of the Chan-Robbins-Yuen polytope equals the product of consecutive Catalan…

Combinatorics · Mathematics 2016-12-02 Sylvie Corteel , Jang Soo Kim , Karola Mészáros

The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…

Combinatorics · Mathematics 2010-04-21 Felix Breuer , Aaron Dall

We introduce a new broadly unifying family of combinatorial objects, which we call permutation flows, associated to an acyclic directed graph $G$ together with a framing $F$. This new family is combinatorially rich and contains as special…

Combinatorics · Mathematics 2025-12-04 Rafael S. González D'León , Christopher R. H. Hanusa , Martha Yip

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

It was conjectured by Jaeger, Linial, Payan, and Tarsi in 1992 that for any prime number $p$, there is a constant $c$ such that for any $n$, the union (with repetition) of the vectors of any family of $c$ linear bases of $\mathbb{Z}_p^n$…

Combinatorics · Mathematics 2018-03-14 Louis Esperet , Rémi de Joannis de Verclos , Tien-Nam Le , Stéphan Thomassé

We study five-dimensional ${\cal N}=1$ Superconformal Field Theories of the linear quiver type. These are deformed by a relevant operator, corresponding to a homogeneous mass term for certain matter fields. The free energy is calculated at…

High Energy Physics - Theory · Physics 2023-09-11 Mohammad Akhond , Andrea Legramandi , Carlos Nunez , Leonardo Santilli , Lucas Schepers

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 simple graph of order $n$ with eigenvalues $\lambda_1(G)\geq \cdots \geq \lambda_n(G)$. Define \[s^+(G)=\sum_{\lambda_i >0} \lambda_i^2(G), \quad s^-(G)=\sum_{\lambda_i<0} \lambda_i^2(G).\] It was conjectured by Elphick,…

Combinatorics · Mathematics 2025-06-10 Saieed Akbari , Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada , Shengtong Zhang