English
Related papers

Related papers: Stem-Symmetry, Comb Products, and their Relation t…

200 papers

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…

Group Theory · Mathematics 2011-03-22 Denis Osin , Mark Sapir

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Group Theory · Mathematics 2021-05-27 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

In an increasingly interconnected world, understanding and summarizing the structure of these networks becomes increasingly relevant. However, this task is nontrivial; proposed summary statistics are as diverse as the networks they…

Statistics Theory · Mathematics 2020-04-15 Lee M. Gunderson , Gecia Bravo-Hermsdorff

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

Combinatorics · Mathematics 2021-01-08 Ken-ichi Kawarabayashi , Bojan Mohar , Roman Nedela , Peter Zeman

Let $g$ be locally homogeneous (LH) Riemannian metric on a differentiable compact manifold $M$, and $K$ be a compact Lie group endowed with an $\mathrm {ad}$-invariant inner product on its Lie algebra $\mathfrak{k}$. A connection $A$ on a…

Differential Geometry · Mathematics 2020-02-19 Arash Bazdar , Andrei Teleman

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 prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Combinatorics · Mathematics 2020-01-15 James Davies , Carsten Thomassen

The Hawkes graph $\Gamma_H(G)$ of $G$ is the directed graph whose vertex set coincides with $\pi(G)$ and it has the edge $(p, q)$ whenever $q\in\pi(G/O_{p',p}(G))$. The Sylow graph $\Gamma_s(G)$ of $G$ is the directed graph with vertex set…

Group Theory · Mathematics 2023-03-24 Viachaslau I. Murashka

In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…

Discrete Mathematics · Computer Science 2017-09-15 Atsushi Yokoyama

We introduce the concept of link-irregular labelings for graphs, extending the notion of link-irregular graphs through edge labeling with positive integers. A labeling is link-irregular if every vertex has a uniquely labeled subgraph…

Combinatorics · Mathematics 2025-07-01 Alexander Bastien , Omid Khormali

The Blow-up Lemma established by Koml\'os, S\'ark\"ozy, and Szemer\'edi in 1997 is an important tool for the embedding of spanning subgraphs of bounded maximum degree. Here we prove several generalisations of this result concerning the…

Combinatorics · Mathematics 2013-05-10 Julia Böttcher , Yoshiharu Kohayakawa , Anusch Taraz , Andreas Würfl

Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized) Fitch relation formalizes xenology as the pairs of genes separated by at least…

Discrete Mathematics · Computer Science 2023-06-22 Marc Hellmuth , Carsten R. Seemann , Peter F. Stadler

We propose a flexible and multi-scale method for organizing, visualizing, and understanding datasets sampled from or near stratified spaces. The first part of the algorithm produces a cover tree using adaptive thresholds based on a…

Computational Geometry · Computer Science 2016-03-01 Paul Bendich , Ellen Gasparovic , Christopher J. Tralie , John Harer

We study attracting graphs of step skew products from the topological and ergodic points of view where the usual contracting-like assumptions of the fiber dynamics are replaced by weaker merely topological conditions. In this context, we…

Dynamical Systems · Mathematics 2017-10-12 Lorenzo J. Díaz , Edgar Matias

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

Combinatorics · Mathematics 2024-03-05 Teng Fang , Sanming Zhou , Shenglin Zhou

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

Category Theory · Mathematics 2025-12-23 Clémence Chanavat , Amar Hadzihasanovic

We show that the extended principal bundle of a Cartan geometry of type $(A(m,\mathbb{R}),GL(m,\mathbb{R}))$, endowed with its extended connection $\hat\omega$, is isomorphic to the principal $A(m,\mathbb{R})$-bundle of affine frames…

Differential Geometry · Mathematics 2020-12-16 Antonio J. Di Scala , Carlos E. Olmos , Francisco Vittone

It is known that graphs cellularly embedded into surfaces are equivalent to ribbon graphs. In this work, we generalize this statement to broader classes of graphs and surfaces. Half-edge graphs extend abstract graphs and are useful in…

Combinatorics · Mathematics 2017-09-06 Remi C. Avohou , Joseph Ben Geloun , Mahouton N. Hounkonnou

An important classification problem in Algebraic Geometry deals with pairs $(\E,\phi)$, consisting of a torsion free sheaf $\E$ and a non-trivial homomorphism $\phi\colon (\E^{\otimes a})^{\oplus b}\lra\det(\E)^{\otimes c}\otimes \L$ on a…

Algebraic Geometry · Mathematics 2007-05-23 Alexander H. W. Schmitt

We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a graph is locally $\ell$-bounded if no vertex is incident to more…

Combinatorics · Mathematics 2019-10-01 Jaehoon Kim , Daniela Kühn , Andrey Kupavskii , Deryk Osthus