English
Related papers

Related papers: Multipath complexes of bidirectional polygonal dig…

200 papers

We use two cofibre sequences to identify some combinatorial situations when the independence complex of a graph splits into a wedge sum of smaller independence complexes. Our main application is to give a recursive relation for the homotopy…

Combinatorics · Mathematics 2012-03-06 Michal Adamaszek

In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-edges}. A graph is called {\em simple} if it contains no…

Discrete Mathematics · Computer Science 2023-12-12 Jan Bok , Jiří Fiala , Nikola Jedličková , Jan Kratochvíl , Paweł Rzążewski

Oriented graph complexes, in which graphs are not allowed to have oriented cycles, govern for example the quantization of Lie bialgebras and infinite dimensional deformation quantization. It is shown that the oriented graph complex GC^or_n…

Quantum Algebra · Mathematics 2015-06-16 Thomas Willwacher

We show that the graphs of nonseparating curves for oriented finite type surfaces are uniformly hyperbolic. Our proof follows the proof of uniform hyperbolicity of the graphs of curves for closed surfaces due to Przytycki-Sisto, while…

Geometric Topology · Mathematics 2020-04-06 Alexander J. Rasmussen

We show that there is a collection of subgroups of the mapping class group of a surface such that the associated coset intersection complex is quasi-isometric and homotopy equivalent to the curve complex. Moreover, we prove that these two…

Geometric Topology · Mathematics 2026-03-13 Haoyang He , Eduardo Martínez-Pedroza

We investigate the existence of homotopy comoment maps (comoments) for high-dimensional spheres seen as multisymplectic manifolds. Especially, we solve the existence problem for compact effective group actions on spheres and provide…

Symplectic Geometry · Mathematics 2025-11-06 Antonio Michele Miti , Leonid Ryvkin

We discuss a graph complex formed by directed acyclic graphs with external legs. This complex comes in particular with a map to the ribbon graph complex computing the (compactly supported) cohomology of the moduli space of points $\mathcal…

Quantum Algebra · Mathematics 2020-05-04 Assar Andersson , Thomas Willwacher , Marko Zivkovic

For a graph $G$, the $t$-th power $G^t$ is the graph on $V(G)$ such that two vertices are adjacent if and only if they have distance at most $t$ in $G$; and the $t$-th bi-power $G_B^t$ is the graph on $V(G)$ such that two vertices are…

Combinatorics · Mathematics 2019-02-19 Binlong Li

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

We study the cohomology of the hairy graph complexes which compute the rational homotopy of embedding spaces, generalizing the Vassiliev invariants of knot theory. We provide spectral sequences converging to zero whose first pages contain…

Quantum Algebra · Mathematics 2016-06-09 Anton Khoroshkin , Thomas Willwacher , Marko Živković

We study two classes of inverse semigroups built from directed graphs, namely graph inverse semigroups and a new class of semigroups that we refer to as Leavitt inverse semigroups. These semigroups are closely related to graph…

Group Theory · Mathematics 2019-11-19 John Meakin , Zhengpan Wang

The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in many areas of mathematics including computational geometry,…

Combinatorics · Mathematics 2026-04-24 Raju Kumar Gupta , Sourav Sarkar , Sagar S. Sawant , Samir Shukla

Hypergraphs are mathematical models for many problems in data sciences. In recent decades, the topological properties of hypergraphs have been studied and various kinds of (co)homologies have been constructed (cf. [3, 4, 12]). In this…

Algebraic Topology · Mathematics 2018-03-15 Stephane Bressan , Jingyan Li , Shiquan Ren , Jie Wu

For a digraph $G$ without multisquares and a field $\mathbb{F}$, we construct a basis of the vector space of path $n$-chains $\Omega_n(G;\mathbb{F})$ for $n\geq 0$, generalising the basis of $\Omega_3(G;\mathbb{F})$ constructed by…

Algebraic Topology · Mathematics 2024-07-25 Xin Fu , Sergei O. Ivanov

The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the…

Combinatorics · Mathematics 2017-08-01 Takahiro Matsushita

We study the existence of multiple closed Reeb orbits on some contact manifolds by means of $S^1$-equivariant symplectic homology and the index iteration formula. It is proved that a certain class of contact manifolds which admit…

Symplectic Geometry · Mathematics 2014-10-16 Jungsoo Kang

In this paper, we prove that discrete Morse functions on digraphs are flat Witten-Morse functions and Witten complexes of transitive digraphs approach to Morse complexes. We construct a chain complex consisting of the formal linear…

Combinatorics · Mathematics 2021-08-19 Yong Lin , Chong Wang

We study the homotopy derivations of the framed little discs operads, which correspond to the homotopy derivations of the BV2n operads. By extending a result by Willwacher about the homotopy derivations of the en operads we show that the…

Algebraic Topology · Mathematics 2020-06-19 Simon Brun

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…

Geometric Topology · Mathematics 2018-08-14 Kathleen Hake , Blake Mellor , Matthew Pittluck

A graph $G$ is $l$-path Hamiltonian if every path of length not exceeding $l$ is contained in a Hamiltonian cycle. It is well known that a 2-connected, $k$-regular graph $G$ on at most $3k-1$ vertices is edge-Hamiltonian if for every edge…

Combinatorics · Mathematics 2022-03-10 Xia Li , Weihua Yang