English
Related papers

Related papers: On dihedral flows in embedded graphs

200 papers

Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is…

Logic in Computer Science · Computer Science 2018-04-30 Noam Zeilberger

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

An unsplittable multiflow routes the demand of each commodity along a single path from its source to its sink node. As our main result, we prove that in series-parallel digraphs, any given multiflow can be expressed as a convex combination…

Combinatorics · Mathematics 2025-07-22 Mohammed Majthoub Almoghrabi , Martin Skutella , Philipp Warode

We verify Tutte's $3$-flow conjecture in the class of Cayley graphs on solvable groups of order $2n$, where $n$ is square-free. The proof relies on a new necessary and sufficient condition for a simple $5$-valent graph to admit a…

Combinatorics · Mathematics 2026-03-26 Milad Ahanjideh , István Kovács

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

We consider a family of 2-step nilpotent Lie algebras associated to uniform complete graphs on odd number of vertices. We prove that the symmetry group of such a graph is the holomorph of the additive cyclic group $\Z_n$. Moreover, we prove…

Differential Geometry · Mathematics 2019-08-14 Debraj Chakrabarti , Meera Mainkar , Savannah Swiatlowski

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

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

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

The $k$-dominating graph $D_k(G)$ of a graph $G$ is defined on the vertex set consisting of dominating sets of $G$ with cardinality at most $k$, two such sets being adjacent if they differ by either adding or deleting a single vertex. A…

Combinatorics · Mathematics 2016-04-26 Saeid Alikhani , Davood Fatehi , Sandi Klavžar

The flow semigroup, introduced by John Rhodes, is an invariant for digraphs and a complete invariant for graphs. After collecting together previous partial results, we refine and prove Rhodes's conjecture on the structure of the maximal…

Combinatorics · Mathematics 2017-08-18 Gábor Horváth , Chrystopher L. Nehaniv , Károly Podoski

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

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

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

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

Bouchet conjectured in 1983 that each signed graph that admits a nowhere-zero flow has a nowhere-zero 6-flow. We prove that the conjecture is true for all signed series-parallel graphs. Unlike the unsigned case, the restriction to…

Combinatorics · Mathematics 2014-11-10 Tomáš Kaiser , Edita Rollová

Let $\Gamma$ be a simple connect graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be \textit{singular} if and only if $0$ is an eigenvalue of $A.$ The \textit{nullity (singularity)} of $\Gamma,$…

Combinatorics · Mathematics 2018-10-09 Ali Sltan Ali AL-Tarimshawy

We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…

Combinatorics · Mathematics 2026-03-20 Zhaochen Ding , Zheng Guo , Luyi Liu

Bouchet conjectured in 1983 that every flow-admissible signed graph admits a nowhere-zero 6-flow which is equivalent to the restriction to cubic signed graphs. In this paper, we proved that every flow-admissible $3$-edge-colorable cubic…

Combinatorics · Mathematics 2022-11-04 Liangchen Li , Chong Li , Rong Luo , C. -Q Zhang , Hailing Zhang

Let $F$ and $G$ be simple finite oriented graphs (without symmetric arcs). A graph $G$ is called $F$-irregular if any two distinct vertices in $G$ belong to a different number of subgraphs of $G$ isomorphic to $F$. In this paper, we…

Combinatorics · Mathematics 2026-05-22 Tatiana Dovzhenok , Ilya Lukashenko , Yahor Filiuta