Related papers: Digital Fundamental Groups and Edge Groups of Cliq…

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques in the class of diamond-free graphs, from both structural…

The edge clique cover number $ecc(G)$ of a graph $G$ is the size of the smallest set of complete subgraphs whose union covers all edges of $G$. It has been conjectured that all the simple graphs with independence number two satisfy…

We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…

In this paper, we show that every topological group is a strong small loop transfer space at the identity element. This implies that the quasitopological fundamental group of a connected locally path connected topological group is a…

Let $ 1 \rightarrow N \rightarrow G \rightarrow Q \rightarrow 1$ be an exact sequence of finitely presented groups where Q is infinite and not virtually cyclic, and is the fundamental group of some closed 3-manifold. If G is Kaehler, we…

We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…

Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups. We prove that, unless $G$ is isomorphic to a free product of free and surface groups, every finite abelian group $M$ appears as a direct summand in…

For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…

We consider a time varying analogue of the Erd{\H o}s-R{\' e}nyi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are determined by the edges, which evolve…

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

The topological fundamental group $\pi_{1}^{top}$ is a homotopy invariant finer than the usual fundamental group. It assigns to each space a quasitopological group and is discrete on spaces which admit universal covers. For an arbitrary…

Two groups are virtually isomorphic if they can be obtained one from the other via a finite number of steps, where each step consists in taking a finite extension or a finite index subgroup (or viceversa). Virtually isomorphic groups are…

The closed neighborhood complex $\mathcal{N}[G]$ of a simple graph $G$ is the simplicial complex whose simplices are finite sets of vertices contained in a closed neighborhood of a vertex in $G$. We reveal that the closed neighborhood…

We study fundamental groups of projective varieties with normal crossing singularities and of germs of complex singularities. We prove that for every finitely-presented group G there is a complex projective surface S with simple normal…

We study the structure of the \'etale fundamental groups of smooth curves over certain arithmetic schemes, and investigate the relative version of Grothendieck's anabelian conjecture in this setting. Consequently, every hyperbolic curve…

The topology of digital images has been studied much in recent years, but no attempt has been made to exhaustively catalog the structure of binary images of small numbers of points. We produce enumerations of several classes of digital…

Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

In this article, we study the fundamental groups of low-dimensional log canonical singularities, i.e., log canonical singularities of dimension at most $4$. In dimension $2$, we show that the fundamental group of an lc singularity is a…