Related papers: Nowhere-Zero $\vec k$-Flows on Graphs
We present a new general method to construct an action functional for a non-potential field theory. The key idea relies on representing the governing equations of the theory relative to a diffeomorphic flow of curvilinear coordinates which…
We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…
We provide a combinatorial presentation of the set F of 3-dimensional generic flows, namely the set of pairs (M,v) with M a compact oriented 3-manifold and v a nowhere-zero vector field on M having generic behaviour along the boundary of M,…
The famous flow decomposition theorem of Gallai (1985) states that any static edge $s$,$d$-flow in a directed graph can be decomposed into a nonnegative linear combination of incidence vectors of paths and cycles. In this paper, we study…
The independence polynomial $I(G,x)$ of a finite graph $G$ is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether, given a fixed number of vertices and edges, there exists…
Flows on surfaces are one of the most fundamental and classical objects in dynamical systems, and are studied from various areas (e.g. integrable systems, differential equations, fluid mechanics). Though hyperbolic flows and recurrent flows…
The cycle polynomial of a finite permutation group $G$ is the generating function for the number of elements of $G$ with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},\] where $c(g)$ is the number of cycles of $g$ on $\Omega$.…
We consider variational (density functional) models of fluids confined in parallel-plate geometries (with walls situated in the planes z=0 and z=L respectively) and focus on the structure of the pair correlation function G(r_1,r_2). We show…
The analogue of Hadwiger's conjecture for the immersion relation states that every graph $G$ contains an immersion of $K_{\chi(G)}$. For graphs with independence number 2, this is equivalent to stating that every such $n$-vertex graph…
We investigate the nodal count of eigenvectors of random matrices interpreted as operators on signed complete graphs. Our focus is on orthogonally invariant ensembles, with particular attention to the Gaussian Orthogonal Ensemble (GOE). We…
We initiate the study of $k$-edge-connected orientations of undirected graphs through edge flips for $k \geq 2$. We prove that in every orientation of an undirected $2k$-edge-connected graph, there exists a sequence of edges such that…
We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…
A bridgeless graph $G$ is called $3$-flow-critical if it does not admit a nowhere-zero $3$-flow, but $G/e$ has for any $e\in E(G)$. Tutte's $3$-flow conjecture can be equivalently stated as that every $3$-flow-critical graph contains a…
Goldman defined a symplectic form on the smooth locus of the $G$-character variety of a closed, oriented surface $S$ for a Lie group $G$ satisfying very general hypotheses. He then studied the Hamiltonian flows associated to $G$-invariant…
A non-zero component graph $G(\mathbb{V})$ associated to a finite vector space $\mathbb{V}$ is a graph whose vertices are non-zero vectors of $\mathbb{V}$ and two vertices are adjacent, if their corresponding vectors have at least one…
We show that Property $(A)$ of subshifts and the semigroup, that is associated to subshifts with Property (A), are invariants of flow equivalence. We show for certain $\mathcal R$-graphs that their isomorphism is implied by the flow…
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the arcs. If the source and the sink are on the same face, then…
Using classical double G of a Lie algebra g equipped with a classical R-operator we define two sets of mutually commuting functions with respect to the initial Lie-Poisson bracket on g* and its extensions. We consider in details examples of…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut…