English
Related papers

Related papers: Multipath complexes of bidirectional polygonal dig…

200 papers

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…

Combinatorics · Mathematics 2007-07-18 Matthew Baker , Serguei Norine

We show that the dominance complex $\mathcal{D}(G)$ of a graph $G$ coincides with the combinatorial Alexander dual of the neighborhood complex $\mathcal{N}(\overline{G})$ of the complement of $G$. Using this, we obtain a relation between…

Combinatorics · Mathematics 2024-11-01 Takahiro Matsushita , Shun Wakatsuki

It is known that non-isomorphic strongly regular graphs with the same parameters must be cospectral (have the same eigenvalues). In this paper, we investigate whether the spectra of higher order Laplacians associated with these graphs can…

Combinatorics · Mathematics 2025-08-11 Sebastian M. Cioabă , Krystal Guo , Chunxu Ji , Mutasim Mim

Motivated by constructions in topological data analysis and algebraic combinatorics, we study homotopy theory on the category of Cech closure spaces $\mathbf{Cl}$, the category whose objects are sets endowed with a Cech closure operator and…

Algebraic Topology · Mathematics 2022-09-28 Antonio Rieser

We investigate oriented graphs based on the curve complex $C(S)$ of a closed surface $S$ and induced by functions on the vertex set of $C(S)$. In particular, we introduce the Dehn quasi-homothetic functions, which behave similarly to…

Geometric Topology · Mathematics 2025-07-18 Dong Tan , Wen Yang

The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite…

Computational Complexity · Computer Science 2011-11-09 Guohun Zhu

We introduce new methods for understanding the topology of $\Hom$ complexes (spaces of homomorphisms between two graphs), mostly in the context of group actions on graphs and posets. We view $\Hom(T,-)$ and $\Hom(-,G)$ as functors from…

Combinatorics · Mathematics 2015-03-13 Anton Dochtermann , Carsten Schultz

We introduce Mayer path homology, a new homology theory for directed path complexes obtained by equipping path complexes with an $N$-nilpotent differential. The main novelty of this work is the introduction of an $N$-differential on path…

Algebraic Topology · Mathematics 2026-05-19 Dilan Karaguler , Guo-Wei Wei

Invariants for Riemann surfaces covered by the disc and for hyperbolic manifolds in general involving minimizing the measure of the image over the homotopy and homology classes of closed curves and maps of the $k$-sphere into the manifold…

Complex Variables · Mathematics 2022-06-17 Robert E. Greene , Kang-Tae Kim , Nikolay V. Shcherbina

We show that the categories of directed and undirected reflexive graphs carry exactly two (up to isomorphism) biclosed monoidal structures.

Combinatorics · Mathematics 2025-11-25 Adrien Grenier , Chris Kapulkin

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

Computational Geometry · Computer Science 2023-08-22 Oswin Aichholzer , Birgit Vogtenhuber , Alexandra Weinberger

For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand…

Combinatorics · Mathematics 2014-09-18 Michal Adamaszek

Robin Forman's highly influential 2002 paper A User's Guide to Discrete Morse Theory presents an overview of the subject in a very readable manner. As a proof of concept, the author determines the topology (homotopy type) of the abstract…

Combinatorics · Mathematics 2025-01-20 Anupam Mondal , Pritam Chandra Pramanik

It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph $D=(V,A)$, a cost function $w: A\rightarrow \{0,1\}$ and a natural…

Combinatorics · Mathematics 2024-03-13 Jørgen Bang-Jensen , Yun Wang , Anders Yeo

A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…

Combinatorics · Mathematics 2025-07-30 Erik Carlson , Willem Fletcher , MurphyKate Montee , Chi Nguyen , Jarne Renders , Xingyi Zhang

We study homotopy groups of spaces of long links in Euclidean space of codimension at least three. With multiple components, they admit split injections from homotopy groups of spheres. We show that, up to knotting, these account for all…

Geometric Topology · Mathematics 2025-02-19 Robin Koytcheff

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Combinatorics · Mathematics 2024-06-11 Bartłomiej Bychawski

In this document, we propose a bridge between the graphs and the geometric realizations of their Vietoris Rips complexes, i.e. Graphs, with their canonical \v{C}ech closure structure, have the same homotopy type that the realization of…

Algebraic Topology · Mathematics 2024-07-02 Jonathan Treviño-Marroquín

We prove that homotopy invariants of finite degree distinguish homotopy classes of maps of a connected compact CW-complex to a nilpotent connected CW-complex with finitely generated homotopy groups.

Algebraic Topology · Mathematics 2012-09-11 Semen Podkorytov

We study the independence complexes of families of well-covered circulant graphs discovered by Boros-Gurvich-Milani\v{c}, Brown-Hoshino, and Moussi. Because these graphs are well-covered, their independence complexes are pure simplicial…

Combinatorics · Mathematics 2015-05-13 Jonathan Earl , Kevin N. Vander Meulen , Adam Van Tuyl
‹ Prev 1 8 9 10 Next ›