English
Related papers

Related papers: Minor exclusion in quasi-transitive graphs

200 papers

We prove a converse theorem for the case of quasi-split non-split even special orthogonal groups over finite fields. There are two main difficulties which arise from the outer automorphism and non-split part of the torus. The outer…

Representation Theory · Mathematics 2025-01-29 Alexander Hazeltine

A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the index two subgroup…

Group Theory · Mathematics 2011-03-30 Alice Devillers , Michael Giudici , Cai Heng Li , Cheryl E. Praeger

Let $\Gamma$ be a connected $G$-vertex-transitive graph, let $v$ be a vertex of $\Gamma$ and let $L=G_v^{\Gamma(v)}$ be the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$. Then…

Combinatorics · Mathematics 2011-02-04 Primoz Potocnik , Pablo Spiga , Gabriel Verret

We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…

Group Theory · Mathematics 2026-03-17 Koichi Oyakawa

In this article we develop the theory of minors of non-commutative schemes. This study is motivated by applications in the theory of non-commutative resolutions of singularities of commutative schemes. In particular, we construct a…

Algebraic Geometry · Mathematics 2022-07-27 Igor Burban , Yuriy Drozd , Volodymyr Gavran

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

Combinatorics · Mathematics 2010-03-19 Matthias Hamann

Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…

General Topology · Mathematics 2023-03-07 Karim Chaira , Oleksiy Dovgoshey

We characterize those 1-ended word hyperbolic groups whose Gromov boundaries are homeomorphic to trees of graphs (i.e. to inverse limits of graphs that have particularly simple finitary descriptions). These are groups with the simplest…

Group Theory · Mathematics 2025-04-29 Nima Hoda , Jacek Świątkowski

We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…

Combinatorics · Mathematics 2020-10-22 Jelena Sedlar

The quasi-redirecting (QR) boundary is a close generalization of the Gromov boundary to all finitely generated groups. In this paper, we establish that the QR boundary exists as a topological space for several well-studied classes of…

Group Theory · Mathematics 2025-04-01 Hoang Thanh Nguyen , Yulan Qing

We prove an analog of the Szemer\'edi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field $\mathrm{R}$. One new ingredient in the proof is an extension of the well…

Logic · Mathematics 2017-07-14 Saugata Basu , Orit E. Raz

We estimate the number of graphical regular representations (GRRs) of a given group with large enough order. As a consequence, we show that almost all finite Cayley graphs have full automorphism groups 'as small as possible'. This confirms…

Combinatorics · Mathematics 2023-08-01 Binzhou Xia , Shasha Zheng

We prove several rigidity properties for random quotients of mapping class groups of surfaces, namely whose kernel is normally generated by the n-th steps of finitely many independent random walks. Firstly, we generalise a celebrated…

Group Theory · Mathematics 2025-08-18 Giorgio Mangioni

We give a cohomological criterion for certain decomposition of Borel graphs, which is an analog of Dunwoody's work on accessibility of groups. As an application, we prove that a Borel graph $(X,G)$ with uniformly bounded degrees of…

Group Theory · Mathematics 2026-03-12 Hiroki Ishikura

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

Group Theory · Mathematics 2015-06-03 R. Rajkumar , P. Devi

We describe all quasiconformal maps on the higher (real and complex) model Filiform groups equipped with the Carnot metric, including non-smooth ones. These maps have very special forms. In particular, they are all biLipschitz and preserve…

Complex Variables · Mathematics 2013-08-15 Xiangdong Xie

For every $r \in \mathbb{N}$, let $\theta_r$ denote the graph with two vertices and $r$ parallel edges. The $\theta_r$-girth of a graph $G$ is the minimum number of edges of a subgraph of $G$ that can be contracted to $\theta_r$. This…

Combinatorics · Mathematics 2017-01-19 Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos

We prove that the saddle connection graph associated to any half-translation surface is 4-hyperbolic and uniformly quasi-isometric to the regular countably infinite-valent tree. Consequently, the saddle connection graph is not…

Geometric Topology · Mathematics 2020-12-10 Valentina Disarlo , Huiping Pan , Anja Randecker , Robert Tang

Suppose that $X$ is an infinite, connected, locally finite, quasi-transitive graph with the property that every bi-infinite quasi-geodesic uniformly coarsely separates $X$ into exactly two deep pieces. We show that such an $X$ is…

Group Theory · Mathematics 2025-11-17 Joseph MacManus

We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are…

Combinatorics · Mathematics 2018-03-23 Christoph Hofer-Temmel , Florian Lehner
‹ Prev 1 8 9 10 Next ›