Related papers: Nonplanar graphs in boundaries of CAT(0) groups

It is shown that certain natural maps between the ideal, Gromov, and end boundaries of a complete CAT(0) space can fail to be either injective or surjective. Additionally the natural map from the Gromov boundary to the end boundary of a…

Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…

Let \(G\) be a non-discrete, locally compact group with Haar measure \(m\). We prove that there exists a compact set \(K \subset G\) with \(m(K)=0\) such that \(KK^{-1}\) contains a neighborhood of the identity. Moreover, such a set may be…

We prove that for a non-amenable, locally finite, connected, transitive, planar graph with one end, any automorphism invariant site percolation on the graph does not have exactly 1 infinite 1-cluster and exactly 1 infinite 0-cluster a.s. If…

We give a short geometric proof of a result of Soardi & Woess and Salvatori that a quasitransitive graph is amenable if and only if its automorphism group is amenable and unimodular. We also strengthen one direction of that result by…

The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…

We will determine all infinite $2$-locally finite groups as well as infinite $2$-groups with planar subgroup graph and show that infinite groups satisfying the chain conditions containing an involution do not have planar embeddings. Also,…

We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by…

The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the…

Let D_1 be a subdomain of D_2 in the complex plane CC. Under very mild conditions on D_2 we show that there exist holomorphic functions f, defined on D_1 with the property that $f$ is nowhere extendible across the boundary of D_1, while the…

We prove that every locally finite quasi-transitive graph that does not contain $K_\infty$ as a minor is quasi-isometric to some planar quasi-transitive locally finite graph. This solves a problem of Esperet and Giocanti and improves their…

We study the global topological structure and smoothness of the boundaries of $\varepsilon$-neighbourhoods $E_\varepsilon = \{x \in \mathbb{R}^2 \, : \, \textrm{dist}(x, E) \leq \varepsilon \}$ of planar sets $E \subset \mathbb{R}^2$. We…

For every positive integer $n$ we construct an example of a subgroup $L< G$ of a linear ${\rm CAT}(0)$ group $G$ such that $L$ is of finiteness type $\mathcal{F}_{n-1}$ and not $\mathcal{F}_n$, and $L$ does not admit a representation into…

We construct examples of smooth 4-dimensional manifolds M supporting a locally CAT(0)-metric, whose universal cover X satisfy Hruska's isolated flats condition, and contain 2-dimensional flats F with the property that the boundary at…

A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

We first consider the class K of graphs on a zero-dimensional metrizable compact space with continuous chromatic number at least three. We provide a concrete basis of size continuum for K made up of countable graphs, comparing them with the…

We study finite foldable cubical complexes of nonpositive curvature (in the sense of A.D. Alexandrov). We show that such a complex X admits a graph of spaces decomposition. It is also shown that when dim X=3, X contains a closed rank one…

Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…

Two graphs $G$ and $H$ are \emph{hypomorphic} if there exists a bijection $\varphi \colon V(G) \rightarrow V(H)$ such that $G - v \cong H - \varphi(v)$ for each $v \in V(G)$. A graph $G$ is \emph{reconstructible} if $H \cong G$ for all $H$…