Related papers: Many flows in the group connectivity setting

A graph of order $n>3$ is called {switching separable} if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having at least two vertices. We prove the…

For $k \ge 4$, let $Q_{2k}$ and $V_{2k}$ denote the ladder and M\"obius ladder on $2k$ vertices, respectively. We prove results that build on a result by Wormald that states that any cyclically $4$-connected cubic graph other than $Q_8$ or…

Using a generalization of the Kechris-Pestov-Todor\v{c}evi\'{c} correspondence due to Nguyen Van Th\'{e} we obtain fixed point theorems for null and tame actions of groups of the form $\mathrm{Aut}(\mathcal F)$, where $\mathcal{F}$ is a…

Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

A graph $G$ contains another graph $H$ as an immersion if $H$ can be obtained from a subgraph of $G$ by splitting off edges and removing isolated vertices. In this paper, we prove an edge-variant of the Erd\H{o}s-P\'{o}sa property with…

The 2-dimensional global rigidity has been shown to be equivalent to 3-connectedness and redundant rigidity by a combination of two results due to Jackson and Jord\'an, and Connelly, respectively. By the characterization, a theorem of…

Interest in Riemannian manifolds with holonomy equal to the exceptional Lie group $\mathrm{G}_2$ have spurred extensive research in geometric flows of $\mathrm{G}_2$-structures defined on seven-dimensional manifolds in recent years. Among…

Let $G$ be a bridgeless cubic graph. In 2023, the three authors solved a conjecture (also known as the $S_4$-Conjecture) made by Mazzuoccolo in 2013: there exist two perfect matchings of $G$ such that the complement of their union is a…

We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other, in the sense that the flow saturates the cut and is zero…

We explore the well-known Jaeger's directed cycle double cover conjecture which is equivalent to the assertion that every cubic bridgeless graph has an embedding on a closed orientable surface with no dual loop. We associate each cubic…

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

In a previous work it is shown that every finite group $G$ of diffeomorphisms of a connected smooth manifold $M$ of dimension $\geq 2$ equals, up to quotient by the flow, the centralizer of the group of smooth automorphisms of a…

Let $M$ be a smooth compact surface of nonpositive curvature, with genus $\geq 2$. We prove the ergodicity of the geodesic flow on the unit tangent bundle of $M$ with respect to the Liouville measure under the condition that the set of…

We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equivalence of the associated two-sided shift spaces. Using groupoid techniques, we prove that this is always the case for shifts of finite…

We study a flow of $G_2$ structures which induce the same Riemannian metric which is the negative gradient flow of an energy functional. We prove Shi-type estimates for the torsion tensor along the flow. We show that at a finite-time…

Building on recent work by Thomassen, we show that Nash-Williams' orientation theorem, that every finite $2k$-edge-connected multigraph has a $k$-arc-connected orientation, also holds for all infinite multigraphs.

A graph G on omega_1 is called <omega-smooth if for each uncountable subset W of omega_1, G is isomorphic to G[W-W'] for some finite W'. We show that in various models of ZFC if a graph G is <omega-smooth then G is necessarily trivial, i.e,…

Inspired by work of Besson-Courtois-Gallot, we construct a flow called the natural flow on a non-positively curved Riemannian manifold $M$. As with the natural map, the $k$-Jacobian of the natural flow is directly related to the critical…

This paper proves a conjecture generated by the artificial intelligence conjecturing program called \emph{TxGraffiti}. More specifically, we show that if $G$ is a connected, cubic, and claw-free graph, then $Z(G) \le \gamma(G) + 2$, where…