English
Related papers

Related papers: Homotopy theory for digraphs

200 papers

We show that discrete and classical homotopy theories are equivalent after localizing at n-equivalences for any non-negative integer n. By constructing an explicit homotopy inverse to the graph nerve functor associating an n-fibrant cubical…

Algebraic Topology · Mathematics 2026-02-24 Daniel Carranza , Chris Kapulkin

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

Computational Complexity · Computer Science 2014-12-02 Christian Engels

In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…

Combinatorics · Mathematics 2018-01-04 Yangjing Long

By introducing various topologies on the homotopy groups of a topological space, some researchers make these well known notions in algebraic topology more useful and powerful. In this paper, first we recall and review some known topologies…

Algebraic Topology · Mathematics 2026-02-25 Naghme Shahami , Behrooz Mashayekhy

We give the first tractable and systematic examples of nontrivial higher digraph homotopy groups. To do this we define relative digraph homotopy groups and show these satisfy a long exact sequence analogous to the relative homotopy groups…

Algebraic Topology · Mathematics 2025-04-08 Stephen Theriault , Jie Wu , Shing-Tung Yau , Mengmeng Zhang

Let $p$ be an odd prime. From a simple undirected graph $G$, through the classical procedures of Baer (Trans. Am. Math. Soc., 1938), Tutte (J. Lond. Math. Soc., 1947) and Lov\'asz (B. Braz. Math. Soc., 1989), there is a $p$-group $P_G$ of…

Combinatorics · Mathematics 2020-05-05 Xiaoyu He , Youming Qiao

A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…

Combinatorics · Mathematics 2010-11-19 Robert Gray , Dugald Macpherson , Cheryl E. Praeger , Gordon F. Royle

We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…

Logic in Computer Science · Computer Science 2021-12-20 Jonathan Prieto-Cubides

Directed Algebraic Topology is beginning to emerge from various applications. The basic structure we shall use for such a theory, a 'd-space', is a topological space equipped with a family of 'directed paths', closed under some operations.…

Algebraic Topology · Mathematics 2007-05-23 Marco Grandis

In this paper, we develop a $\times$-homotopy fundamental groupoid for graphs, and show a functorial relationship to the 2-category of graphs. We further explore the fundamental groupoid of graph products and develop a groupoid product…

Combinatorics · Mathematics 2020-07-14 Tien Chih , Laura Scull

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…

Combinatorics · Mathematics 2012-07-19 Deborah Lockett

A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.

Combinatorics · Mathematics 2013-11-26 Matthias Hamann

In classical homotopy theory, two spaces are homotopy equivalent if one space can be continuously deformed into the other. This theory, however, does not respect the discrete nature of graphs. For this reason, a discrete homotopy theory…

Combinatorics · Mathematics 2022-09-12 Rachel Hardeman Morrill

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}$,…

Quantum Physics · Physics 2026-04-21 Tim Seppelt , Gian Luca Spitzer

The modern theory of homogeneous structures begins with the work of Roland Fra\"iss\'e. The theory developed in the last seventy years is placed in the border area between combinatorics, model theory, algebra, and analysis. We turn our…

Combinatorics · Mathematics 2026-01-13 Bojana Pavlica , Christian Pech , Maja Pech

The notion of $\times$-homotopy from \cite{DocHom} is investigated in the context of the category of pointed graphs. The main result is a long exact sequence that relates the higher homotopy groups of the space $\Hom_*(G,H)$ with the…

Combinatorics · Mathematics 2008-07-07 Anton Dochtermann

We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…

Dynamical Systems · Mathematics 2020-05-06 Gilles Gonçalves de Castro , Daniel Gonçalves , Daniel W van Wyk

This paper develops a basic theory of H-groups. We introduce a special quotient of H-groups and extend some algebraic constructions of topological groups to the category of H-groups and H-maps. We use these constructions to prove some…

Algebraic Topology · Mathematics 2010-09-28 Ali Pakdaman , Hamid Torabi , Behrooz Mashayekhy

We develop a theory of $\times$-homotopy, fundamental groupoids and covering spaces that apply to non-simple graphs, generalizing existing results for simple graphs. We prove that $\times$-homotopies from finite graphs can be decomposed…

Combinatorics · Mathematics 2026-03-17 Tien Chih , Laura Scull