English
Related papers

Related papers: On the tangle compactification of infinite graphs

200 papers

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

Combinatorics · Mathematics 2013-10-02 Keith Mellinger , Ryan Vaughn , Oscar Vega

Groups of almost upper triangular infinite matrices with entries indexed by integers are studied. It is shown that, when the matrices are over a finite field, these groups admit a nondiscrete totally disconnected, locally compact group…

Group Theory · Mathematics 2019-12-17 Peter Groenhout , Colin D. Reid , George A. Willis

In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…

Combinatorics · Mathematics 2020-09-08 Carl Bürger , Ruben Melcher

We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…

Combinatorics · Mathematics 2026-04-17 Csaba Biró , Caroline E. Boone , Beth Novick , Hazel Torek

Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…

Metric Geometry · Mathematics 2011-09-14 Itai Benjamini , Oded Schramm , Adam Timar

An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…

Discrete Mathematics · Computer Science 2021-03-09 Matthieu Latapy , Thi Ha Duong Phan , Christophe Crespelle , Thanh Qui Nguyen

Directions of graphs were originally introduced in the study of a cops-and-robbers kind of game, while the study of end spaces has been used to generalize classical graph-theoretical results to infinite graphs, such as Halin's…

Combinatorics · Mathematics 2025-10-21 Gustavo Boska , Matheus Duzi , Paulo Magalhães Júnior

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2016-01-28 Andrei A. Bulatov

We study tangle replacement in the context of spatial graphs. The main results show that, for certain spatial handcuff graphs, there is a one-to-one correspondence between the neighborhood equivalence classes of the spatial graphs obtained…

Geometric Topology · Mathematics 2025-11-27 Giovanni Bellettini , Giovanni Paolini , Maurizio Paolini , Yi-Sheng Wang

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

Logic · Mathematics 2008-09-22 Bakhadyr Khoussainov , Jiamou Liu , Mia Minnes

We first study Clarke's tangent cones at infinity to unbounded subsets of $\mathbb{R}^n.$ We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real…

Optimization and Control · Mathematics 2024-05-17 Minh Tung Nguyen , Tien-Son Pham

A circle of an infinite locally finite graph $G$ is the imagine of a homeomorphic mapping of the unit circle $S^1$ in $|G|$, the Freudenthal compactification of $G$. A circle of $G$ is Hamiltonian if it meets every vertex (and then every…

Combinatorics · Mathematics 2019-04-29 Binlong Li

The galaxies of nonstandard enlargements of conventionally infinite as well as of transfinite graphs are defined, analyzed, and illustrated by some examples. It is then shown that any such enlargement either has exactly one galaxy, its…

Combinatorics · Mathematics 2007-05-23 A. H. Zemanian

Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…

Combinatorics · Mathematics 2023-08-22 David Cimasoni , Adrien Kassel

Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…

Combinatorics · Mathematics 2019-03-20 Roman Glebov , Daniel Kral , Jan Volec

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

Group Theory · Mathematics 2016-03-23 Cora Welsch

We consider moduli spaces of quilted strips with markings and their compactifications. Using the theory of moment maps of toric varieties we identify the compactified moduli spaces with certain graph associahedra. We demonstrate how these…

Algebraic Geometry · Mathematics 2015-05-27 Sikimeti Ma'u

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

Geometric Topology · Mathematics 2014-10-14 Ariadna Fossas , Hugo Parlier

A graph is chordal if it contains no induced cycle of length four or more. While finite chordal graphs are precisely those admitting tree-decompositions into cliques, this fails for infinite graphs. We establish two results extending the…

Combinatorics · Mathematics 2026-03-26 Max Pitz , Lucas Real , Roman Schaut

Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…

Group Theory · Mathematics 2017-08-08 Sang-hyun Kim , Thomas Koberda , Juyoung Lee