Related papers: Coverings of Profinite Graphs
This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering theory. For both problems, we characterize necessary and…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…
In this work we produce a framework for constructing universal function approximators on graph isomorphism classes. We prove how this framework comes with a collection of theoretically desirable properties and enables novel analysis. We…
A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of several decompositions. Four of the basic…
A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove…
A profinite group is called small if it has only finitely many open subgroups of index n for each positive integer n. We show that every Frattini cover of a small profinite group is small. A profinite group is called strongly complete if…
In this paper, we introduce the notions of $r$-fundamental groups of graphs, $r$-covering maps, and $r$-neighborhood complexes of graphs for a positive integer $r$. There is a natural correspondence between $r$-covering maps and…
We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups…
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings…
We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are…
We prove that for every prime $p$ algebraically clean graphs of groups are virtually residually $p$-finite and cohomologically $p$-complete. We also prove that they are cohomologically good. We apply this to certain $2$-dimensional Artin…
For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…
Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…
Recently there has been a lot of research and progress in profinite groups. We survey some of the new results and discuss open problems. A central theme is decompositions of finite groups into bounded products of subsets of various kinds…
In this paper we define and develop the theory of the cohomology of a profinite group relative to a collection of closed subgroups. Having made the relevant definitions we establish a robust theory of cup products and use this theory to…