Related papers: Removable singularities for nonlocal minimal graph…
We describe the global structure of totally disconnected locally compact groups having a linear open compact subgroup. Among the applications, we show that if a non-discrete, compactly generated, topologically simple, totally disconnected…
A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…
We study the local behavior of weak solutions, with possible singularities, of nonlocal nonlinear equations. We first prove that sets of capacity zero are removable for weak solutions under certain integrability conditions. We then…
In a graph $G=(V,E)$, a module is a vertex subset $M$ of $V$ such that every vertex outside $M$ is adjacent to all or none of $M$. For example, $\emptyset$, $\{x\}$ $(x\in V )$ and $V$ are modules of $G$, called trivial modules. A graph,…
We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof…
The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data…
A group topology is said to be linear if open subgroups form a base of neighborhoods of the identity element. It is proved that the existence of a nondiscrete extremally disconnected group of Ulam nonmeasurable cardinality with linear…
A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by deleting fewer than $k$ vertices. The block number $\beta(G)$ of $G$ is the maximum integer $k$ for which $G$ contains a…
We apply the local removable singularity theorem for minimal laminations and the local picture theorem on the scale of topology to obtain two descriptive results for certain possibly singular minimal laminations of $\mathbb{R}^3$. These two…
A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…
We construct a parabolic entire minimal graph $S$ over a finite topology complete Riemannian surface $\Sigma$ of curvature $-1$ and infinite area (thus of non-parabolic conformal type). The vertical projection of this graph yields a…
We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…
An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally finite quasi-transitive graphs avoiding a minor, which is…
A graph is non-trivial if it contains at least one nonloop edge. The essential connectivity of $G$, denoted by $\kappa'(G)$, is the minimum number of vertices of $G$ whose removal produces a disconnected graph with at least two components…
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…
We prove that the minimally displaced set of a relatively irreducible automorphism of a free splitting, situated in a deformation space, is uniformly locally finite. The minimally displaced set coincides with the train track points for an…
Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…
The graph removal lemma is a fundamental result in extremal graph theory which says that for every fixed graph $H$ and $\varepsilon > 0$, if an $n$-vertex graph $G$ contains $\varepsilon n^2$ edge-disjoint copies of $H$ then $G$ contains…
A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…
We study the removability of compact sets for continuous Sobolev functions. In particular, we focus on sets with infinitely many complementary components, called "detour sets", which resemble the Sierpi\'nski gasket. The main theorem is…