Related papers: Cofinite Graphs and their Profinite Completions
We investigate the local topological structure of non-metrizable topological groups through the lens of Tukey order and cofinal types. Motivated by recent advances in topological groups admitting an $\omega^\omega$-base, we introduce the…
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
Let $\Gamma$ be a non-elementary Kleinian group and $H<\Gamma$ a finitely generated, proper subgroup. We prove that if $\Gamma$ has finite co-volume, then the profinite completions of $H$ and $\Gamma$ are not isomorphic. If $H$ has finite…
A ringed finite space is a ringed space whose underlying topological space is finite. The category of ringed finite spaces contains, fully faithfully, the category of finite topological spaces and the category of affine schemes. Any ringed…
Necessary and sufficient conditions for the exactness (in the algebraic sense) of certain sequences of continuous group homomorphisms are established.
A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A well-covered graph $G$ is called uniformly well-covered if there is a partition of the set of vertices of $G$ such that each maximal…
Let $G$ be a finite group. For some fixed prime $p$, let $\Gamma_p(G)$ be the common divisor graph built on the set of sizes of $p$-regular conjugacy classes of $G$: this is the simple undirected graph whose vertices are the class sizes of…
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end…
Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…
We show that the topological space of any infinite graph and its ends is normal. In particular, end spaces themselves are normal.
We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used…
Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives…
A graph $\Gamma$ labelled by a set $S$ defines a group $G(\Gamma)$ whose generators are the set of labels $S$ and whose relations are all words which can be read on closed paths of this graph. We introduce the notion of aspherical graph and…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
In this paper, we introduce a symmetric continuous cohomology of topological groups. This is obtained by topologizing a recent construction due to Staic (J. Algebra 322 (2009), 1360-1378), where a symmetric cohomology of abstract groups is…
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
A finite simple graph $\Gamma$ determines a quotient $P_\Gamma$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior…