English
Related papers

Related papers: Flows on Bidirected Graphs

200 papers

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…

Probability · Mathematics 2007-08-06 David J. Aldous , Shankar Bhamidi

We present a new experimental set-up that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We…

In 1960, Nash-Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of directed paths between any two vertices is at least half the number of undirected paths between them (rounded…

Combinatorics · Mathematics 2024-09-17 Max Pitz , Jacob Stegemann

A vertex of a graph is bisimplicial if the set of its neighbors is the union of two cliques; a graph is quasi-line if every vertex is bisimplicial. A recent result of Chudnovsky and Seymour asserts that every non-empty even-hole-free graph…

Combinatorics · Mathematics 2021-06-24 Zi-Xia Song

For an abelian group $\Gamma$, a graph $G$ is said to be $\Gamma$-flow-critical if $G$ does not admit a nowhere-zero $\Gamma$-flow, but for each edge $e\in E(G)$, the contraction $G/e$ has a nowhere-zero $\Gamma$-flow. A bound on the…

Combinatorics · Mathematics 2022-12-06 Zdeněk Dvořák , Bojan Mohar

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…

Combinatorics · Mathematics 2015-09-22 Eckhard Steffen

Given a $t$-$(v, k, \lambda)$ design, $\mathcal{D}=(X,\mathcal{B})$, a zero-sum $n$-flow of $\mathcal{D}$ is a map $f : \mathcal{B}\longrightarrow \{\pm1,\ldots, \pm(n-1)\}$ such that for any point $x\in X$, the sum of $f$ over all blocks…

Combinatorics · Mathematics 2021-01-05 Saieed Akbari , Hamid Reza Maimani , Leila Parsaei Majd , Ian M. Wanless

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 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…

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…

Analysis of PDEs · Mathematics 2023-12-12 Congming Li , Yingshu Lv , Henrik Shahgholian , Chunjing Xie

Kochol introduced the assigning polynomial $F(G,\alpha;k)$ to count nowhere-zero $(A,b)$-flows of a graph $G$, where $A$ is a finite Abelian group and $\alpha$ is a $\{0,1\}$-assigning from a family $\Lambda(G)$ of certain nonempty vertex…

Combinatorics · Mathematics 2024-09-17 Houshan Fu , Xiangyu Ren , Suijie Wang

We introduce, for every surface {\Sigma}, a two-way connection between FO transductions (first-order logical transformations) of the graphs embeddable in {\Sigma} and a certain variant of fan-crossing drawings of graphs in {\Sigma}. If the…

Computational Geometry · Computer Science 2026-03-13 Petr Hliněný , Jan Jedelský

Let $G=(V,E)$ be a graph with four distinguished vertices, two sources $s_1, s_2$ and two sinks $t_1,t_2$, let $c:\, E \rightarrow \mathbb Z_+$ be a capacity function, and let ${\cal P}$ be the set of all simple paths in $G$ from $s_1$ to…

Combinatorics · Mathematics 2024-07-26 Guoli Ding , Rongchuan Tao , Mengxi Yang , Wenan Zang

While the Anomaly flow was originally motivated by string theory, its zero slope case is potentially of considerable interest in non-Kahler geometry, as it is a flow of conformally balanced metrics whose stationary points are precisely…

Differential Geometry · Mathematics 2018-05-25 Duong H. Phong , Sebastien Picard , Xiangwen Zhang

In this article, we study the ergodicity of the geodesic flows on surfaces with no focal points. Let $M$ be a smooth connected and closed surface equipped with a $C^\infty$ Riemannian metric $g$, whose genus $\mathfrak{g} \geq 2$. Suppose…

Dynamical Systems · Mathematics 2018-12-12 Weisheng Wu , Fei Liu , Fang Wang

A vertex in a directed graph is said to have a large second neighborhood if it has at least as many second out-neighbors as out-neighbors. The Second Neighborhood Conjecture, first stated by Seymour, asserts that there is a vertex having a…

Discrete Mathematics · Computer Science 2021-10-25 Suresh Dara , Mathew C. Francis , Dalu Jacob , N. Narayanan

Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads…

Dynamical Systems · Mathematics 2017-06-07 Vladislav Kruglov , Dmitry Malyshev , Olga Pochinka

We analyse the topological (knot-theoretic) features of a certain codimension-one bifurcation of a partially hyperbolic fixed point in a flow on $\real^3$ originally described by Shil'nikov. By modifying how the invariant manifolds wrap…

Dynamical Systems · Mathematics 2016-09-07 Robert Ghrist , Todd Young

In this paper, we construct a set of new functionals of Ricci curvature on any Kaehler manifolds which are invariant under holomorphic transfermations in Kaehler Einstein manifolds and essentially decreasing under the Kaehler Ricci flow.…

Differential Geometry · Mathematics 2007-05-23 Xiuxiong Chen , Gang Tian

As a strengthening of Hadwiger's conjecture, Gerards and Seymour conjectured that every graph with no odd $K_t$ minor is $(t-1)$-colorable. We prove two weaker variants of this conjecture. Firstly, we show that for each $t \geq 2$, every…

Combinatorics · Mathematics 2019-06-17 Dong Yeap Kang , Sang-il Oum
‹ Prev 1 4 5 6 7 8 10 Next ›