相关论文: A Homotopy Theory for Graphs

We present different ways of endowing a particular category of graphs with Quillen model structures. We show, among other things, that the core of a graph can be seen as its homotopy type in an appropriate Quillen model structure, and that…

In recent work, Stokes and Vermant considered graph-of-groups realisations of hypergraphs as a new description of rigidity-theoretic problems. In this paper, we show that the infinitesimal aspects of graph-of-groups realisations can be…

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

We show that mapping class groups associated to all types of real algebraic curves are virtual duality groups. We also deduce some results about the orbifold homotopy groups of the moduli spaces of real algebraic curves. We achieve these…

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

The Jacobian group of a graph is a finite abelian group through which we can study the graph in an algebraic way. When the graph is a finite abelian covering of another graph, the Jacobian group is equipped with the action of the Galois…

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

In this paper, we consider homological properties of so-called graph ideals. Consider $\Gamma$ is a graph with vertices $t_1$, ..., $t_s$, without self-loops and multiple adjacencies. We can associate with such a graph an ideal…

The homology groups of the automorphism group of a free group are known to stabilize as the number of generators of the free group goes to infinity, and this paper relativizes this result to a family of groups that can be defined in terms…

We introduce a model structure on the category of graphs, which is Quillen equivalent to the category of $\mathbb{Z}_2$-spaces. A weak equivalence is a graph homomorphism which induces a $\mathbb{Z}_2$-homotopy equivalence between their box…

A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…

We extend the homotopy theories based on point reduction for finite spaces and simplicial complexes to finite acyclic categories and $\Delta$-complexes, respectively. The functors of classifying spaces and face posets are compatible with…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…

In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…

In this article, we prove that, given two finite connected graphs $\Gamma_1$ and $\Gamma_2$, if the two right-angled Artin groups $A(\Gamma_1)$ and $A(\Gamma_2)$ are quasi-isometric, then the infinite pointed sums $\bigvee_\mathbb{N}…