English
Related papers

Related papers: A study of 2-ended graphs via harmonic functions

200 papers

We study a finite sequence of graphs, beginning with the curve graph and ending with a graph quasi-isometric to a tree. There is a Lipschitz map from one graph in the sequence to the next. This sequence was first introduced by Hamenst\"adt.…

Geometric Topology · Mathematics 2025-10-07 Mladen Bestvina , Kenneth Bromberg , Alexander J. Rasmussen

Let $\Gamma$ be a finite connected $G$-vertex-transitive graph and let $v$ be a vertex of $\Gamma$. If the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$ is permutation isomorphic to…

Combinatorics · Mathematics 2012-11-15 Pablo Spiga , Gabriel Verret

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…

Combinatorics · Mathematics 2016-06-16 Marston Conder , Jin-Xin Zhou , Yan-Quan Feng , Mi-Mi Zhang

The \emph{genus} $\mathrm{g}(G)$ of a graph $G$ is the minimum $g$ such that $G$ has an embedding on the orientable surface $M_g$ of genus $g$. A drawing of a graph on a surface is \emph{independently even} if every pair of nonadjacent…

Combinatorics · Mathematics 2019-03-21 Radoslav Fulek , Jan Kynčl

Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…

Group Theory · Mathematics 2020-08-11 Monalisha Sharma , Rajat Kanti Nath

Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and…

Combinatorics · Mathematics 2013-01-10 Michael Giudici , Cai Heng Li , Akos Seress , Anne Thomas

For a collection $\mathbf{G}=\{G_1,\dots, G_s\}$ of not necessarily distinct graphs on the same vertex set $V$, a graph $H$ with vertices in $V$ is a $\mathbf{G}$-transversal if there exists a bijection $\phi:E(H)\rightarrow [s]$ such that…

Combinatorics · Mathematics 2023-09-07 Felix Joos , Jaehoon Kim

A graph $G$ is called a $2K_2$-free graph if it does not contain $2K_2$ as an induced subgraph. In 2014, Broersma, Patel and Pyatkin showed that every 25-tough $2K_2$-free graph on at least three vertices is Hamiltonian. Recently, Shan…

Combinatorics · Mathematics 2021-12-06 Katsuhiro Ota , Masahiro Sanka

Let $\Gamma$ be a graph and let $G$ be a group of automorphisms of $\Gamma$. The graph $\Gamma$ is called $G$-normal if $G$ is normal in the automorphism group of $\Gamma$. Let $T$ be a finite non-abelian simple group and let $G = T^l$ with…

Combinatorics · Mathematics 2017-08-22 Jia-Li Du , Yan-Quan Feng

Let $X$ be a Banach space or more generally a complete metric space admitting a conical geodesic bicombing. We prove that every closed $L$-Lipschitz curve $\gamma:S^1\rightarrow X$ may be extended to an $L$-Lipschitz map defined on the…

Metric Geometry · Mathematics 2019-02-20 Paul Creutz

Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…

Differential Geometry · Mathematics 2024-03-25 Florent Balacheff , Wolfgang Pitsch

In 1980, Thomassen stated his weak linkage conjecture: for an odd positive integer k, if a graph G is k-edge-connected, then, for any collection of k pairs of vertices {s_1,t_1}, ..., {s_k,t_k} in G, not necessarily distinct, there are…

Combinatorics · Mathematics 2026-02-19 Amena Assem , R. Bruce Richter

The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…

Combinatorics · Mathematics 2023-11-06 Laurine Bénéteau , Jérémie Chalopin , Victor Chepoi , Yann Vaxès

We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is…

Commutative Algebra · Mathematics 2016-05-03 Arindam Banerjee , Luis Núñez-Betancourt

In this paper we introduce and study a type of Cayley graph -- subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph $K_{p^d,p^d}$ with $p$…

Combinatorics · Mathematics 2021-01-13 Shu Jiao Song

Given a finite simple graph $\cG$ with $n$ vertices, we can construct the Cayley graph on the symmetric group $S_n$ generated by the edges of $\cG$, interpreted as transpositions. We show that, if $\cG$ is complete multipartite, the…

Combinatorics · Mathematics 2010-08-03 Filippo Cesi

This paper initiates the investigation of the family of $(G,s)$-geodesic-transitive digraphs with $s\geq 2$. We first give a global analysis by providing a reduction result. Let $\Gamma$ be such a digraph and let $N$ be a normal subgroup of…

Combinatorics · Mathematics 2023-03-15 Wei Jin

We prove that a (globally) subanalytic p-adic function which is locally Lipschitz continuous with some constant C is piecewise (globally on each piece) Lipschitz continuous with possibly some other constant, where the pieces can be taken…

Algebraic Geometry · Mathematics 2011-01-28 R. Cluckers , G. Comte , F. Loeser

The isoperimetric constant of a graph $G$ on $n$ vertices, $i(G)$, is the minimum of $\frac{|\partial S|}{|S|}$, taken over all nonempty subsets $S\subset V(G)$ of size at most $n/2$, where $\partial S$ denotes the set of edges with…

Probability · Mathematics 2007-05-23 Itai Benjamini , Simi Haber , Michael Krivelevich , Eyal Lubetzky

We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…

Combinatorics · Mathematics 2019-01-03 Michael Giudici , Gabriel Verret