English
Related papers

Related papers: Helly meets Garside and Artin

200 papers

Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty intersection. This is a classical and widely studied class of graphs. In this article we focus on groups acting geometrically on Helly graphs --…

Group Theory · Mathematics 2025-01-08 Jérémie Chalopin , Victor Chepoi , Anthony Genevois , Hiroshi Hirai , Damian Osajda

A simplicial graph is said to be (coarsely) Helly if any collection of pairwise intersecting balls has non-empty (coarse) intersection. (Coarsely) Helly groups are groups acting geometrically on (coarsely) Helly graphs. Our main result is…

Group Theory · Mathematics 2024-05-14 Damian Osajda , Motiejus Valiunas

A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. Motivated by previous work on dually chordal graphs and graphs of bounded distance VC-dimension we prove several new results on the…

Data Structures and Algorithms · Computer Science 2019-11-12 Feodor F. Dragan , Guillaume Ducoffe

Starting with a lattice with an action of $\mathbb{Z}$ or $\mathbb{R}$, we build a Helly graph or an injective metric space. We deduce that the $\ell^\infty$ orthoscheme complex of any bounded graded lattice is injective. We also prove a…

Group Theory · Mathematics 2024-12-18 Thomas Haettel

A collection of sets is intersecting, if any pair of sets in the collection has nonempty intersection. A collection of sets \(\mathcal{C}\) has the Helly property if any intersecting subcollection has nonempty intersection. A graph is…

Combinatorics · Mathematics 2022-05-26 Rafael Villarroel-Flores

This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying themes of our investigation are various `nonpositive…

Metric Geometry · Mathematics 2022-03-03 Jérémie Chalopin , Victor Chepoi , Hiroshi Hirai , Damian Osajda

In this paper we investigate some problems related to the Helly properties of circular-arc graphs, which are defined as intersection graphs of arcs of a fixed circle. As such, circular-arc graphs are among the simplest classes of…

Data Structures and Algorithms · Computer Science 2024-04-10 Jan Derbisz , Tomasz Krawczyk

A new metric parameter for a graph, Helly-gap, is introduced. A graph $G$ is called $\alpha$-weakly-Helly if any system of pairwise intersecting disks in $G$ has a nonempty common intersection when the radius of each disk is increased by an…

Discrete Mathematics · Computer Science 2020-05-06 Feodor F. Dragan , Heather M. Guarnera

We prove a variety of fixed-point theorems for groups acting on CAT$(0)$ spaces. Fixed points are obtained by a bootstrapping technique, whereby increasingly large subgroups are proved to have fixed points: specific configurations in the…

Group Theory · Mathematics 2025-05-05 Martin R. Bridson

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

Logic · Mathematics 2013-08-19 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

A graph is Helly if its disks satisfy the Helly property, i.e., every family of pairwise intersecting disks in G has a common intersection. It is known that for every graph G, there exists a unique smallest Helly graph H(G) into which G…

Discrete Mathematics · Computer Science 2020-07-29 Heather M. Guarnera , Feodor F. Dragan , Arne Leitert

A Helly circular-arc model M = (C,A) is a circle C together with a Helly family \A of arcs of C. If no arc is contained in any other, then M is a proper Helly circular-arc model, if every arc has the same length, then M is a unit Helly…

Discrete Mathematics · Computer Science 2015-03-19 Min Chih Lin , Francisco J. Soulignac , Jayme L. Szwarcfiter

We study Helly graphs of finite combinatorial dimension, i.e. whose injective hull is finite-dimensional. We describe very simple fine simplicial subdivisions of the injective hull of a Helly graph, following work of Lang. We also give a…

Combinatorics · Mathematics 2023-10-18 Thomas Haettel

In this article we study combinatorial non-positive curvature aspects of various simplicial complexes with natural $\widetilde A_n$ shaped simplicies, including Euclidean buildings of type $\widetilde A_n$ and Cayley graphs of Garside…

Group Theory · Mathematics 2023-09-08 Thomas Haettel , Jingyin Huang

The Helly number of a family of sets with empty intersection is the size of its largest inclusion-wise minimal sub-family with empty intersection. Let F be a finite family of open subsets of an arbitrary locally arc-wise connected…

Combinatorics · Mathematics 2011-02-25 Éric Colin de Verdière , Grégory Ginot , Xavier Goaoc

Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…

Combinatorics · Mathematics 2024-11-26 Pavel Paták

A finite family $\mathcal F$ of convex sets is $k$-intersecting in $S \subseteq \mathbb{R}^d$ if the intersection of every subset of $k$ convex sets in $\mathcal F$ contains a point in $S$. The Helly number of $S$ is the minimum $k$, if it…

Combinatorics · Mathematics 2025-04-24 Srinivas Arun , Travis Dillon

We prove that asymptotic cones of Helly graphs are countably hyperconvex. We use this to show that virtually nilpotent Helly groups are virtually abelian and to characterize virtually abelian Helly groups via their point groups. In fact, we…

Group Theory · Mathematics 2023-07-13 Nima Hoda

It is shown that for a linear algebraic group G over a field of characteristic zero, there is a natural number \kappa(G) such that if a system of Zariski closed cosets in G has empty intersection, then there is a subsystem consisting of at…

Representation Theory · Mathematics 2014-02-26 M. Domokos , E. Szabó

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
‹ Prev 1 2 3 10 Next ›