English
Related papers

Related papers: Obstructions to a small hyperbolicity in Helly gra…

200 papers

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 key technique of machine learning and computer vision is to embed discrete weighted graphs into continuous spaces for further downstream processing. Embedding discrete hierarchical structures in hyperbolic geometry has proven very…

Machine Learning · Computer Science 2023-08-17 Frank Nielsen , Ke Sun

For a fixed graph $H$ on $k$ vertices, and a graph $G$ on at least $k$ vertices, we write $G\rightarrow H$ if in any vertex-coloring of $G$ with $k$ colors, there is an induced subgraph isomorphic to $H$ whose vertices have distinct colors.…

Combinatorics · Mathematics 2016-05-23 Maria Axenovich , Ryan Martin

We prove that the hierarchical hull of any finite set of interior points, hierarchy rays, and boundary points in a hierarchically hyperbolic space (HHS) is quasi-median quasi-isometric to a CAT(0) cube complex of bounded dimension. Our…

Group Theory · Mathematics 2023-08-29 Matthew Gentry Durham

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…

Discrete Mathematics · Computer Science 2017-01-31 Jiří Fiala , Pavel Klavík , Jan Kratochvíl , Roman Nedela

In this paper we enumerate and classify the ``simplest'' pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the pairs we use a variation of Matveev's definition of complexity for…

Geometric Topology · Mathematics 2008-05-01 Damian Heard , Craig Hodgson , Bruno Martelli , Carlo Petronio

The Local Structure Theorem (LST) for Graph Minors roughly states that for every $H$-minor-free graph $G$ that contains a sufficiently large wall $W$, there is a small vertex subset $A,$ whose removal yields a graph that admits an "almost…

We establish three criteria of hyperbolicity of a graph in terms of ``average width of geodesic bigons''. In particular we prove that if the ratio of the Van Kampen area of a geodesic bigon $\beta$ and the length of $\beta$ in the Cayley…

Group Theory · Mathematics 2022-12-27 Victor Gerasimov , Leonid Potyagailo

A group G is acylindrically hyperbolic if it admits a non-elementary acylindrical action on a hyperbolic space. We prove that every acylindrically hyperbolic group G has a generating set X such that the corresponding Cayley graph is a…

Group Theory · Mathematics 2018-03-16 Sahana Balasubramanya

A subset $M$ of the edges of a graph or hypergraph is hitting if $M$ covers each vertex of $H$ at least once, and $M$ is $t$-shallow if it covers each vertex of $H$ at most $t$ times. We consider the existence of shallow hitting edge sets…

Combinatorics · Mathematics 2023-07-13 Tim Planken , Torsten Ueckerdt

How many monochromatic paths, cycles or general trees does one need to cover all vertices of a given $r$-edge-coloured graph $G$? These problems were introduced in the 1960s and were intensively studied by various researchers over the last…

Combinatorics · Mathematics 2020-08-05 Matija Bucić , Dániel Korándi , Benny Sudakov

In this paper we study some open questions related to the smallest order $f({\cal C},\lnot {\cal H})$ of a 4-regular graph which has a connectivity property ${{\cal C}}$ but does not have a hamiltonian property ${\cal H}$. In particular,…

Combinatorics · Mathematics 2021-12-10 Giuseppe Lancia , Eleonora Pippia , Franca Rinaldi

In recent work, Stokes and Vermant considered graph-of-groups realisations of hypergraphs as a new description of rigidity-theoretic problems. In this paper, we show that the infinitesimal aspects of graph-of-groups realisations can be…

Combinatorics · Mathematics 2026-04-03 Joannes Vermant

A matching in a hypergraph $H$ is a set of pairwise disjoint hyperedges. The matching number $\alpha'(H)$ of $H$ is the size of a maximum matching in $H$. A subset $D$ of vertices of $H$ is a dominating set of $H$ if for every $v\in…

Combinatorics · Mathematics 2017-01-09 Yanxia Dong , Erfang Shan , Shan Li , Liying Kang

We prove that the ends of a properly immersed simply or one connected minimal surface in H(2)xR contained in a slab of height less than \pi of H(2)xR, are multi-graphs. When such a surface is embedded then the ends are graphs. When embedded…

Differential Geometry · Mathematics 2013-04-09 Pascal Collin , Laurent Hauswirth , Harold Rosenberg

Let $G$ be a relatively hyperbolic group that admits a decomposition into a finite graph of relatively hyperbolic groups structure with quasi-isometrically (qi) embedded condition. We prove that the set of conjugates of all the vertex and…

Group Theory · Mathematics 2019-12-06 Swathi Krishna

A graph $H$ is said to be an induced minor of a graph $G$ if $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions. Equivalently, $H$ is an induced minor of $G$ if there exists an induced minor model of $H$ in…

We show that a bijection $f:\mathbb{H}^2\rightarrow\mathbb{H}^2$ of the hyperbolic plane that sends horocycles to horocycles (respectively hypercycles to hypercycles) is an isometry. This extends a previous result of J. Jeffers on geodesics…

Geometric Topology · Mathematics 2024-05-29 Cheikh Lo , Abdoul Karim Sane

This paper establishes connections between the structure of a semigroup and the minimum spans of distance labellings of its Cayley graphs. We show that certain general restrictions on the minimum spans are equivalent to the semigroup being…

Combinatorics · Mathematics 2015-09-04 Andrei Kelarev , Charl Ras , Sanming Zhou

Recently, Zhang and Wu proved a conjecture of Kalai and Meshulam, showing that for every graph $G$ without induced cycles of length divisible by $3$, the sum of all reduced Betti numbers of its independence complex $I(G)$ is at most $1$. We…

Combinatorics · Mathematics 2025-12-29 Jinha Kim
‹ Prev 1 8 9 10 Next ›