Related papers: Coverings of Profinite Graphs

The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

We characterise the structure of those graphs of a given order which maximise the number of connected induced subgraphs for seven different graph classes, each with other prescribed parameters like minimum degree, independence number,…

A graph $G$ is $[a,b]$-covered if for each edge $e$ of $G$ there is an $[a,b]$-factor containing it. For $a=b=1$, an $[a,b]$-covered graph is a matching covered graph. The structural theory of matching covered graphs constitutes a…

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

We give some background on uniform pro-p groups and the model theory of profinite NIP groups.

In this paper we study some consequences of the author's classification of graph manifolds by their profinite fundamental groups. In particular we study commensurability, the behaviour of knots, and relation to mapping classes. We prove…

Graphs are fundamental data structures which concisely capture the relational structure in many important real-world domains, such as knowledge graphs, physical and social interactions, language, and chemistry. Here we introduce a powerful…

Topos properties of the category of covering groupoids over a fixed groupoid are discussed. A classification result for connected covering groupoids over a fixed groupoid analogous to the fundamental theorem of Galois theory is given.

We obtain some general restrictions on the continuous endomorphisms of a profinite group G under the assumption that G has only finitely many open subgroups of each index (an assumption which automatically holds, for instance, if G is…

In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…

The sets of closed and closed-normal subgroups of a profinite group carry a natural profinite topology. Through a combination of algebraic and topological methods the size of these subgroup spaces is calculated, and the spaces partially…

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

A profinite group $G$ is just infinite if every closed normal subgroup of $G$ is of finite index. We prove that an infinite profinite group is just infinite if and only if, for every open subgroup $H$ of $G$, there are only finitely many…

This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…

We give a short, self-contained, and easily verifiable proof that determining the outerthickness of a general graph is NP-hard. This resolves a long-standing open problem on the computational complexity of outerthickness. Moreover, our…

We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms.…

In this paper we investigate some properties of the Burnside ring of a profinite group as defined in \cite{ds}. We introduce the notion of the crossed Burnside ring of a profinite FC-group, and generalise some results from finite to…

For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…

We completely describe the finitely generated pro-$p$ subgroups of the profinite completion of the fundamental group of an arbitrary $3$-manifold. We also prove a pro-$p$ analogue of the main theorem of Bass--Serre theory for finitely…