English
Related papers

Related papers: Accessibility, planar graphs, and quasi-isometries

200 papers

A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a…

Data Structures and Algorithms · Computer Science 2013-12-20 William Evans , Michael Kaufmann , William Lenhart , Giuseppe Liotta , Tamara Mchedlidze , Stephen Wismath

A hierarchy of a group is a rooted tree of groups obtained by iteratively passing to vertex groups of graphs of groups decompositions. We define a (relative) slender JSJ hierarchy for (almost) finitely presented groups and show that it is…

Group Theory · Mathematics 2017-06-14 Larsen Louder , Nicholas Touikan

Two groups are virtually isomorphic if they can be obtained one from the other via a finite number of steps, where each step consists in taking a finite extension or a finite index subgroup (or viceversa). Virtually isomorphic groups are…

Geometric Topology · Mathematics 2016-02-15 Roberto Frigerio

We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if…

Combinatorics · Mathematics 2016-10-21 Yoshiharu Kohayakawa , Vojtěch Rödl , Mathias Schacht

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Group Theory · Mathematics 2020-03-04 B. Akbari , Mark L. Lewis , J. Mirzajani , A. R. Moghaddamfar

We construct minor-closed addable families of graphs that are subcritical and contain all planar graphs. This contradicts (one direction of) a well-known conjecture of Noy.

Combinatorics · Mathematics 2018-01-08 Agelos Georgakopoulos , Stephan Wagner

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

Combinatorics · Mathematics 2024-02-16 Martin Otto

Witte Morris showed in [21] that every connected Cayley graph of a finite (generalized) dihedral group has a Hamiltonian path. The infinite dihedral group is defined as the free product with amalgamation $\mathbb Z_2 \ast \mathbb Z_2$. We…

Combinatorics · Mathematics 2026-01-16 Babak Miraftab , Konstantinos Stavropoulos

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…

Combinatorics · Mathematics 2025-08-06 Alireza Abdollahi , Majid Arezoomand , Tao Feng , Shixin Wang

We introduce a new quasi-isometry invariant for finitely generated groups and show that every group with this property admits a subshift which is effectively closed by patterns and that cannot be realized as the topological factor of any…

Group Theory · Mathematics 2025-10-14 Sebastián Barbieri , Kanéda Blot , Mathieu Sablik , Ville Salo

The class of quasi-median graphs is a generalisation of median graphs, or equivalently of CAT(0) cube complexes. The purpose of this thesis is to introduce these graphs in geometric group theory. In the first part of our work, we extend the…

Group Theory · Mathematics 2017-12-06 Anthony Genevois

We prove that graph products of sofic groups are sofic, as are graphs of groups for which vertex groups are sofic and edge groups are amenable.

Group Theory · Mathematics 2016-01-20 Laura Ciobanu , Derek F. Holt , Sarah Rees

This note is a continuation of the study of the relationship between the geometry of Cayley graphs and the size of its metric-functional boundary. We show that, if there exists a Cayley graph with finitely many Busemann points, then the…

Group Theory · Mathematics 2025-11-27 Corentin Bodart , Liran Ron-George , Ariel Yadin

We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle…

Discrete Mathematics · Computer Science 2016-09-28 Didier Caucal

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

Group Theory · Mathematics 2025-12-29 Yuandong Li , Binzhou Xia , Jin-Xin Zhou

In this paper we describe all the finite almost simple groups whose Gruenberg--Kegel graphs coincide with Gruenberg--Kegel graphs of finite solvable groups.

Group Theory · Mathematics 2016-06-14 Ilya B. Gorshkov , Natalia V. Maslova

This note is about the geometry of the pants graph P(S), a natural simplicial graph associated to a finite type topological surface S where vertices represents pants decompositions. The main result in this note ascserts that for a…

Geometric Topology · Mathematics 2013-06-14 José L. Estévez

This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…

Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…

Rings and Algebras · Mathematics 2025-09-18 Lisa Orloff Clark , Malcolm Jones

We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…

Combinatorics · Mathematics 2024-01-15 Martin Otto