Related papers: Nowhere-zero flows on signed eulerian graphs
We study a normalized version of the second order renormalization group flow on closed Riemannian surfaces. We discuss some general properties of this flow and establish several basic formulas. In particular, we focus on surfaces with zero…
Given a zero-sum function $\beta : V(G) \rightarrow \mathbb{Z}_3$ with $\sum_{v\in V(G)}\beta(v)=0$, an orientation $D$ of $G$ with $d^+_D(v)-d^-_D(v)= \beta(v)$ in $\mathbb{Z}_3$ for every vertex $v\in V(G)$ is called a…
We associate a graph to a possible non-zero zero-divisor in the group algebra of a torsion-free group.
In this paper, an upper bound on the nullity of signed graphs in terms of the cyclomatic number and the number of pendant vertices is proved, and the corresponding extremal signed graphs are completely characterized.
Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise structural answer to this question. Essentially, we show that…
Incompressible Euler flows in narrow domains, in which the horizontal length scale is much larger than other scales, play an important role in applications, and their leading-order behavior can be described by the hydrostatic Euler…
We survey results and conjectures concerning the zero distribution of chromatic and flow polynomials of graphs, and characteristic polynomials of matroids.
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
Given a non-trivial finite Abelian group $(A,+)$, let $n(A) \ge 2$ be the smallest integer such that for every labelling of the arcs of the bidirected complete graph of order $n(A)$ with elements from $A$ there exists a directed cycle for…
A signed circuit cover of a signed graph is a natural analog of a circuit cover of a graph, and is equivalent to a covering of its corresponding signed-graphic matroid with circuits. It was conjectured that a signed graph whose…
We prove that an eulerian graph $G$ admits a decomposition into $k$ closed trails of odd length if and only if and it contains at least $k$ pairwise edge-disjoint odd circuits and $k\equiv |E(G)|\pmod{2}$. We conjecture that a connected…
In this paper, we investigate steady Euler flows in a two-dimensional bounded domain. By an adaption of the vorticity method, we prove that for any nonconstant harmonic function $q$, which corresponds to a nontrivial irrotational flow,…
Jaeger, Linial, Payan, and Tarsi introduced the notion of $A$-connectivity for graphs in 1992, and proved a decomposition for cubic graphs from which $A$-connectivity follows for all 3-edge-connected graphs when $|A|\geq 6$. The concept of…
A zero-dimensional (resp. symbolic) flow is a suspension flow over a zero-dimensional system (resp. a subshift). We show that any topological flow admits a principal extension by a zero-dimensional flow. Following [Bur19] we deduce that any…
In this paper, we study inextensible flows of partially null and pseudo null curves in E_1^4. We give neccessary and sufficent conditions for inextensible flows of partially null and pseudo null curves in E_1^4
We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…
We consider rigidity properties of steady Euler flows in two-dimensional bounded domains. We prove that steady Euler flows in a disk with exactly one interior stagnation point and tangential boundary conditions must be circular flows, which…
The paper characterizes $(2t+1)$-regular graphs with circular flow number $2 + \frac{2}{2t-1}$. For $t=1$ this is Tutte's characterization of cubic graphs with flow number 4. The class of cubic graphs is the only class of odd regular graphs…
Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which admits two such avoiding circuits starting from any vertex…
It is proven that the only incompressible Euler fluid flows with fixed straight streamlines are those generated by the normal lines to a round sphere, a circular cylinder or a flat plane, the fluid flow being that of a point source, a line…