Related papers: Many flows in the group connectivity setting
In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects each dicut. Woodall conjectured in 1976 that in every digraph, the minimum size of a dicut equals to the maximum number…
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…
Let G=(V,E) be a simple undirected graph. For a given set L of the real line, a function omega from E to L is called an L-flow. Given a vector gamma whose coordinates are indexed by V, we say that omega is a gamma-L-flow if for each v in V,…
If X is any connected Cayley graph on any finite abelian group, we determine precisely which flows on X can be written as a sum of hamiltonian cycles. (This answers a question of Brian Alspach.) In particular, if the degree of X is at least…
A recent prominent result asserts that steady incompressible Euler flows strictly away from stagnation in a two-dimensional infinitely long strip must be shear flows. On the other hand, flows with stagnation points, very challenging in…
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…
Bermond, Jackson and Jaeger [{\em J. Combin. Theory Ser. B} 35 (1983): 297-308] proved that every bridgeless ordinary graph $G$ has a circuit $4$-cover and Fan [{\em J. Combin. Theory Ser. B} 54 (1992): 113-122] showed that $G$ has a…
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…
We study the positive Hermitian curvature flow for left-invariant metrics on $2$-step nilpotent Lie groups with a left-invariant complex structure $J$. We describe the long-time behavior of the flow under the assumption that…
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constant $c$ such that there is an infinite family of 4-regular 4-connected graphs, each containing exactly $c$ hamiltonian cycles. We complement…
We recall theorems by Krygin, Atkinson, Shneiberg and propose the following assertion. Let $T_t$ be an ergodic flow on $(X,\mu)$, let a function $f$ on $X$ have zero mean, and $\mu(A)>0$ for $A\subset X$. Then for almost all $x\in A$ with…
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
In [8], the gradient conjecture of R. Thom was proven for gradient flows of analytic functions on Rn. This result means that the secant at a limit point converges, so that the flow cannot spiral forever. Once the trajectory becomes…
Let $G$ be a connected nilpotent Lie group. Given probability-preserving $G$-actions $(X_i,\Sigma_i,\mu_i,u_i)$, $i=0,1,...,k$, and also polynomial maps $\phi_i:\mathbb{R}\to G$, $i=1,...,k$, we consider the trajectory of a joining…
In this paper we prove that every sufficiently large 4-edge-connected graph contains the double cycle, $C_{2,r}$, as an immersion. In proving this, we develop a new tool we call a ring-decomposition. We also prove that linear…
We present an extremal result for the class of graphs G which (together with some specified sets of input and output vertices, I and O) have a certain "flow" property introduced by Danos and Kashefi for the one-way measurement model of…
Let $\triangleleft$ be a relation between graphs. We say a graph $G$ is \emph{$\triangleleft$-ubiquitous} if whenever $\Gamma$ is a graph with $nG \triangleleft \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \triangleleft…
An edge $e$ of a graph $G$ is called deletable for some orientation $o$ if the restriction of $o$ to $G-e$ is a strong orientation. Inspired by a problem of Frank, in 2021 H\"orsch and Szigeti proposed a new parameter for $3$-edge-connected…
This article discusses a relatively new geometric flow, called the hypersymplectic flow. In the first half of the article we explain the original motivating ideas for the flow, coming from both 4-dimensional symplectic topology and…
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…