Related papers: Bounded-Excess Flows in Cubic Graphs
In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…
This is a survey of some of the recent developments on the geometric and analytic aspects of the Anomaly flow. It is a flow of $(2,2)$-forms on a $3$-fold which was originally motivated by string theory and the need to preserve the…
In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…
Robust network flows are a concept for dealing with uncertainty and unforeseen failures in the network infrastructure. They and their dual counterpart, network flow interdiction, have received steady attention within the operations research…
A canonical problem of axially strained flow in a duct of circular-sector cross-section, with fluid injection through the circular arc, is examined for a range of Reynolds numbers and sector angles. At small Reynolds numbers, the flow…
A graph $G$ is a link-irregular graph if every two distinct vertices of $G$ have non-isomorphic links. The link of a vertex $v$ in $G$ is the subgraph induced by the neighbors of $v$ in $G$. Ali, Chartrand and Zhang [Discussiones…
Experimental measurements and numerical simulations are made on fluid flow through cross-slot devices with a range of aspect (depth:width) ratios, 0.4 < alpha < 3.87. For low Reynolds numbers Re, the flow is symmetric and a sharp boundary…
We calculate the mean electromotive force in plane Couette flows of a nonrotating conducting fluid under the influence of a large-scale magnetic field for driven turbulence. A vertical stratification of the turbulence intensity results in…
An $r$-regular graph is an $r$-graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Seymour [On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte.~\emph{Proc.~London…
We say that $\alpha\in [0,1)$ is a jump for an integer $r\geq 2$ if there exists $c(\alpha)>0$ such that for all $\epsilon >0 $ and all $t\geq 1$ any $r$-graph with $n\geq n_0(\alpha,\epsilon,t)$ vertices and density at least…
Tutte's famous 5-flow conjecture asserts that every bridgeless graph has a nowhere-zero 5-flow. Seymour proved that every such graph has a nowhere-zero 6-flow. Here we give (two versions of) a new proof of Seymour's Theorem. Both are…
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…
A graph $G$ is {$k$-crossing-critical} if $cr(G)\ge k$, but $cr(G\setminus e)<k$ for each edge $e\in E(G)$, where $cr(G)$ is the crossing number of $G$. It is known that for any $k$-crossing-critical graph $G$, $cr(G)\le 2.5k+16$ holds, and…
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…
Given a set $\xi=\{H_1,H_2,...\}$ of connected non acyclic graphs, a $\xi$-free graph is one which does not contain any member of $% \xi$ as copy. Define the excess of a graph as the difference between its number of edges and its number of…
The single-source unsplittable flow (SSUF) problem asks to send flow from a common source to different terminals with unrelated demands, each terminal being served through a single path. One of the most heavily studied SSUF objectives is to…
Motivated by a conjecture from the automated conjecturing program TxGraffiti, in this paper the relationship between the zero forcing number, $Z(G)$, and the vertex independence number, $\alpha(G)$, of cubic and subcubic graphs is explored.…
We complete the theoretical framework required for the construction of a Morse homology theory for certain types of forced mean curvature flows. The main result of this paper describes the asymptotic behaviour of these flows as the forcing…
A hypergraph $H$ is said to be \emph{linear} if every pair of vertices lies in at most one hyperedge. Given a family $\mathcal{F}$ of $r$-uniform hypergraphs (also called $r$-graphs), an $r$-graph $H$ is said to be \emph{$\mathcal{F}$-free}…
Large-eddy simulations (LES) are performed to study the flow past a 6:1 prolate spheroid placed at an angle of incidence of $\alpha = 10^{\circ}$. The diameter-based Reynolds number ($Re = U_{\infty}D/\nu$) is set to a value of…