Related papers: Manhattan and Chebyshev flows
In this paper, we provide a classification of steady solutions to two-dimensional incompressible Euler equations in terms of the set of flow angles. The first main result asserts that the set of flow angles of any bounded steady flow in the…
A graph is $P_8$-free if it contains no induced subgraph isomorphic to the path $P_8$ on eight vertices. In 1995, Erd\H{o}s and Gy\'{a}rf\'{a}s conjectured that every graph of minimum degree at least three contains a cycle whose length is a…
In this article, we establish the Hopf-Tsuji-Sullivan dichotomy for geodesic flows on certain manifolds with no conjugate points: either the geodesic flow is conservative and ergodic, or it is completely dissipative and non-ergodic. We also…
We study the relation between supersymmetry and geometric flows driven by the Bianchi identity for the three-form flux $H$ in heterotic supergravity. We describe how the flow equations can be derived from a functional that appears in a…
The Ricci flow on the 2-sphere with marked points is shown to converge in all three stable, semi-stable, and unstable cases. In the stable case, the flow was known to converge without any reparametrization, and a new proof of this fact is…
Let $\Gamma$ be a graph, $A$ an abelian group, $\mathcal{D}$ a given orientation of $\Gamma$ and $R$ a unital subring of the endomorphism ring of $A$. It is shown that the set of all maps $\varphi$ from $E(\Gamma)$ to $A$ such that…
We prove for $C^\infty$ non-singular flows on three-dimensional compact manifolds with positive entropy, there are at most finitely many ergodic measures of maximal entropy. This result extends the notable work of Buzzi-Crovisier-Sarig…
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…
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…
Consider the set $\chi^0_{\mathrm{nw}}$ of non-wandering continuous flows on a closed surface. Then such a flow can be approximated by regular non-wandering flows without heteroclinic connections nor locally dense orbits in…
We study transport properties such as electrical and frictionless flow conductance on scale-free and Erdos-Renyi networks. We consider the conductance G between two arbitrarily chosen nodes where each link has the same unit resistance. Our…
We construct a complete invariant for non-wandering surface flows with finitely many singular points but without locally dense orbits. Precisely, we show that a flow $v$ with finitely many singular points on a compact connected surface $S$…
We present a mean-field theory for the dynamics of driven flow with exclusion in graphenelike structures, and numerically check its predictions. We treat first a specific combination of bond transmissivity rates, where mean field predicts,…
A normal edge-coloring of a cubic graph is a proper edge-coloring, in which every edge is adjacent to edges colored with four distinct colors or to edges colored with two distinct colors. It is conjectured that $5$ colors suffice for a…
Let $G$ be a planar graph with no two 3-cycles sharing an edge. We show that if $\Delta(G)\geq 9$, then $\chi'_l(G) = \Delta(G)$ and $\chi''_l(G)=\Delta(G)+1.$ We also show that if $\Delta(G)\geq 6$, then $\chi'_l(G)\leq\Delta(G)+1$ and if…
A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…
We survey known results related to nowhere-zero flows and related topics, such as circuit covers and the structure of circuits of signed graphs. We include an overview of several different definitions of signed graph colouring.
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…
We are interested in the gradient flow of a general first order convex functional with respect to the $L^1$-topology. By means of an implicit minimization scheme, we show existence of a global limit solution, which satisfies an…
We denote a path on $t$ vertices as $P_t$ and a cycle on $t$ vertices as $C_t$. For two vertex-disjoint graphs $G_1$ and $G_2$, the {\em union} $G_1\cup G_2$ is the graph with $V(G_1\cup G_2)=V(G_1)\cup V(G_2)$ and $E(G_1\cup…