Related papers: Nowhere-zero 3-flows in Cayley graphs on supersolv…
There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the original claim holds for non-3-connected graphs if the…
Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…
In this paper we study the dynamics of Bernoulli flows and their subflows over general countable groups from the symbolic and topological perspectives. We study free subflows (subflows in which every point has trivial stabilizer), minimal…
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.
In this note we prove that all connected Cayley graphs of every finite group $Q \times H$ are 1-factorizable, where $Q$ is any non-trivial group of 2-power order and $H$ is any group of odd order.
Consider a continuous flow in $\mathbb{R}^3$ or any orientable $3$-manifold. Let $(Q_1, Q_0)$ be an index pair in the sense of Conley and consider the region $N := \overline{Q_1 - Q_0}$. (An example of this is a compact $3$-manifold $N$…
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the…
Given a finite group $G$ and a subset $S\subseteq G,$ the bi-Cayley graph $\bcay(G,S)$ is the graph whose vertex set is $G \times \{0,1\}$ and edge set is $\{\{(x,0),(s x,1)\} : x \in G, s\in S \}$. A bi-Cayley graph $\bcay(G,S)$ is called…
In this paper, we study arc-transitive Cayley graphs on non-abelian simple groups with soluble stabilizers and valency seven. Let $\Ga$ be such a Cayley graph on a non-abelian simple group $T$. It is proved that either $\Ga$ is a normal…
We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-known conjecture of Benjamini and Schramm (1996) under…
To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…
As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square…
Based on the theory of invariant sets of descending flow, we give a new proof of the existence of three nontrivial solutions and some remarks on it.
We show that if G is any nilpotent, finite group, and the commutator subgroup of G is cyclic, then every connected Cayley graph on G has a hamiltonian cycle.
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,…
The analogue of Hadwiger's conjecture for the immersion order states that every graph $G$ contains $K_{\chi (G)}$ as an immersion. If true, it would imply that every graph with $n$ vertices and independence number $\alpha$ contains…
Graph connectivity serves as a fundamental metric for evaluating the reliability and fault tolerance of interconnection networks. To more precisely characterize network robustness, the concept of cyclic connectivity has been introduced,…
In this paper, we study a combinatorial Ricci flow on closed pseudo $3$-manifolds $(M,\mathcal{T})$. We prove that if every edge in the triangulation $\mathcal{T}$ has valence at least $9$, then the combinatorial Ricci flow converges…
We show that for every non-elementary hyperbolic group, an associated topological flow space admits a coding based on a transitive subshift of finite type. Applications include regularity results for Manhattan curves, the uniqueness of…
We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph…