English
Related papers

Related papers: Nowhere-zero 3-flows in Cayley graphs on supersolv…

200 papers

We show that any manifold admitting a non-collapsed, ancient Ricci flow must have finite fundamental group. This generalizes what was known for $\kappa$-solutions in dimensions 2, 3. We furthermore show that this fundamental group must be a…

Differential Geometry · Mathematics 2021-10-07 Richard H. Bamler

We prove that every $C^1$ generic three-dimensional flow has either infinitely many sinks, or, infinitely many hyperbolic or singular-hyperbolic attractors whose basins form a full Lebesgue measure set. We also prove in the orientable case…

Dynamical Systems · Mathematics 2013-08-09 A. Arbieto , A. Rojas , B. Santiago

A graph (digraph) $G=(V,E)$ with a set $T\subseteq V$ of terminals is called inner Eulerian if each nonterminal node $v$ has even degree (resp. the numbers of edges entering and leaving $v$ are equal). Cherkassky and Lov\'asz showed that…

Differential Geometry · Mathematics 2010-11-15 M. A. Babenko , A. V. Karzanov

A finite group $G$ is called Cayley integral if all undirected Cayley graphs over $G$ are integral, i.e., all eigenvalues of the graphs are integers. The Cayley integral groups have been determined by Kloster and Sander in the abelian case,…

Group Theory · Mathematics 2016-08-11 István Estélyi , István Kovács

Listed as No. 53 among the one hundred famous unsolved problems in [J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, Berlin, 2008] is Steinberg's conjecture, which states that every planar graph without 4- and 5-cycles is 3-colorable.…

Combinatorics · Mathematics 2017-02-27 Ligang Jin , Yingli Kang , Michael Schubert , Yingqian Wang

The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…

Combinatorics · Mathematics 2022-03-25 Xueyi Huang , Kinkar Chandra Das , Lu Lu

Recently, Huang gave a very elegant proof of the Sensitivity Conjecture by proving that hypercube graphs have the following property: every induced subgraph on a set of more than half its vertices has maximum degree at least $\sqrt{d}$,…

Combinatorics · Mathematics 2020-05-22 Florian Lehner , Gabriel Verret

Let $S$ be a set of transpositions that generates the symmetric group $S_n$, where $n \ge 3$. The transposition graph $T(S)$ is defined to be the graph with vertex set $\{1,\ldots,n\}$ and with vertices $i$ and $j$ being adjacent in $T(S)$…

Discrete Mathematics · Computer Science 2015-12-11 Ashwin Ganesan

Let $S$ be a set of transpositions generating the symmetric group $S_n$. The transposition graph of $S$ is defined to be the graph with vertex set $\{1,\ldots,n\}$, and with vertices $i$ and $j$ being adjacent in $T(S)$ whenever $(i,j) \in…

Combinatorics · Mathematics 2015-11-18 Ashwin Ganesan

A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…

Combinatorics · Mathematics 2017-05-15 Wei-Juan Zhang , Yan-Quan Feng , Jin-Xin Zhou

Let $G$ be a finite Abelian group. For a subset $S \subseteq G$, let $T_3(S)$ denote the number of length three arithemtic progressions in $S$ and Prob[$S$] $= \frac{1}{|S|^2}\sum_{x,y \in S} 1_S(x+y)$. For any $q \ge 1$ and $\alpha \in…

Combinatorics · Mathematics 2018-09-12 Zachary Chase

Any $n$-vertex $3$-graph with minimum codegree at least $\lfloor n/3\rfloor$ must have a spanning tight component, but immediately below this threshold it is possible for no tight component to span more than $\lceil 2n/3\rceil$ vertices.…

Combinatorics · Mathematics 2018-11-28 Agelos Georgakopoulos , John Haslegrave , Richard Montgomery

Let $Y_{3,2}$ be the 3-graph with two edges intersecting in two vertices. We prove that every 3-graph $ H $ on $ n $ vertices with at least $ \max \left \{ \binom{4\alpha n}{3}, \binom{n}{3}-\binom{n-\alpha n}{3} \right \}+o(n^3) $ edges…

Combinatorics · Mathematics 2024-04-16 Jie Han , Lin Sun , Guanghui Wang

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

Group Theory · Mathematics 2026-05-14 Joseph Paul MacManus

We show that for any solvable Lie group of real type, any homogeneous Ricci flow solution converges in Cheeger-Gromov topology to a unique non-flat solvsoliton, which is independent of the initial left-invariant metric. As an application,…

Differential Geometry · Mathematics 2017-08-23 Christoph Böhm , Ramiro A. Lafuente

In this paper, we show that for given Bernoulli function and entropy function at the upstream, if the incoming mass flux is within a suitable range, then there exists a unique outer pressure such that smooth subsonic three-dimensional…

Analysis of PDEs · Mathematics 2024-05-13 Yan Li

In this paper it is proved that near a compact, invariant, proper subset of a continuous flow on a compact, connected metric space, at least one, out of twenty eight relevant dynamical phenomena, will necessarily occur. This result shows…

Dynamical Systems · Mathematics 2012-02-14 Pedro Teixeira

We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at…

Combinatorics · Mathematics 2018-01-03 Ian Agol , Vyacheslav Krushkal

We construct a connected cubic nonnormal Cayley graph on $\mathrm{A}_{2^m-1}$ for each integer $m\geqslant4$ and determine its full automorphism group. This is the first infinite family of connected cubic nonnormal Cayley graphs on…

Combinatorics · Mathematics 2019-06-21 Jiyong Chen , Binzhou Xia , Jin-Xin Zhou

Let $\Gamma_n$ be the complete undirected Cayley graph of the odd cyclic group $Z_n$. Connected graphs whose vertices are rainbow tetrahedra in $\Gamma_n$ are studied, with any two such vertices adjacent if and only if they share (as…

Combinatorics · Mathematics 2014-11-06 Italo J. Dejter