Related papers: Removable singularities for nonlocal minimal graph…
We initiate the study of the $p$-local commensurability graph of a group, where $p$ is a prime. This graph has vertices consisting of all finite-index subgroups of a group, where an edge is drawn between $A$ and $B$ if $[A : A\cap B]$ and…
The interaction between local traits and global frameworks of mathematical objects has long endured as a central theme in various mathematical domains. A graph \(G\) is referred to as locally linear provided that the subgraph induced by the…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…
Let $K$ be a complete discretely valued field with the residue field $\kappa$. Assume that cohomological dimension of $\kappa$ is less than or equal to $1$ (for example, $\kappa$ is an algebraically closed field or a finite field). Let $F$…
The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$, denoted $\mathcal{I}(G)$, is the graph whose vertices correspond to the…
The main goal of this paper is proving the fixed point theorem for finite groups acting on weakly systolic complexes. As corollaries we obtain results concerning classifying spaces for the family of finite subgroups of weakly systolic…
Suppose that $G=(V, E)$ be a locally finite and connected graph with symmetric weight and uniformly positive measure, where $V$ denotes the vertex set and $E$ denotes the edge set. We are concered with the following problem $$…
Motivated by an application in condensed matter physics and quantum information theory, we prove that every non-null even-hole-free claw-free graph has a simplicial clique, that is, a clique $K$ such that for every vertex $v \in K$, the set…
We prove a coarse version of Halin's Grid Theorem: Every one-ended, locally finite graph that contains the disjoint union of infinitely many rays as an asymptotic minor also contains the half-grid as an asymptotic minor. More generally, we…
Let $G$ be a non-abelian group. The non-commuting graph $\mathcal{A}_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joint if and only if they do not commute. In a finite simple…
We determine the vertex-minor Ramsey number $\Rvm(4)=11$, where $\Rvm(k)$ is the smallest~$n$ such that every $n$-vertex graph contains the edgeless graph~$E_k$ as a vertex-minor. We prove this by an exhaustive classification of the graphs…
Cartan's uniqueness theorem does not hold in general for CR mappings, but it does hold under certain conditions guaranteeing extendibility of CR functions to a fixed neighborhood. These conditions can be defined naturally for a wide class…
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…
We prove constructively that the maximum possible number of minimal connected dominating sets in a connected undirected graph of order $n$ is in $\Omega(1.489^n)$. This improves the previously known lower bound of $\Omega(1.4422^n)$ and…
Let $G$ be a simple finite graph, and let $\mathcal U_G$ be the related quantum graph. We study the game algebra $C(\mathrm{Qut}(\mathcal U_G))$ of quantum automorphism of $\mathcal U_G$. Moreover, we prove that for any graph $G$ with…
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…
Let M be a graph manifold. We show that \pi_1M is the fundamental group of a compact nonpositively curved cube complex if and only if M is chargeless. We also prove that in that case \pi_1M is virtually compact special.
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the…
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…