English
Related papers

Related papers: Multi-directed graph complexes and quasi-isomorphi…

200 papers

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 study the deformation complex of a canonical morphism $i$ from the properad of (degree shifted) Lie bialgebras $\mathbf{Lieb}_{c,d}$ to its polydifferential version $\mathcal{D}(\mathbf{Lieb}_{c,d})$ and show that it is quasi-isomorphic…

Quantum Algebra · Mathematics 2024-02-02 Vincent Wolff

We show that the wheel classes in the Kontsevich graph complex $GC_d$ admit representatives supported on graphs with only $3$- and $4$-valent vertices. This verifies that Merkulov's low-valence conjecture holds for the wheel classes. More…

Quantum Algebra · Mathematics 2026-05-21 Assar Andersson

In this paper, we study oriented bipartite graphs. In particular, we introduce "bitransitive" graphs. Several characterizations of bitransitive bitournaments are obtained. We show that bitransitive bitounaments are equivalent to acyclic…

Combinatorics · Mathematics 2021-03-16 Sandip Das , Prantar Ghosh , Shamik Ghosh , Sagnik Sen

We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…

Computational Complexity · Computer Science 2009-11-10 Shmuel Friedland

The neighborhood complex of a graph was introduced by Lov\'asz to provide topological lower bounds on chromatic number. More general homomorphism complexes of graphs were further studied by Babson and Kozlov. Such `Hom complexes' are also…

Combinatorics · Mathematics 2023-08-16 Anton Dochtermann , Anurag Singh

We show how the machine of PROP profiles invented by S. Merkulov can be used to study and classify natural operators in differential geometry. We also give an interpretation of graph complexes arising in this context in terms of…

Differential Geometry · Mathematics 2008-02-28 Martin Markl

In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…

Combinatorics · Mathematics 2018-06-05 Attila Sali , Gábor Simonyi , Gábor Tardos

Using the orbicell decomposition of the Deligne-Mumford compactification of the moduli space of Riemann surfaces studied previously, a chain complex based on semistable ribbon graphs is constructed which is an extension of Konsevich's graph…

Algebraic Topology · Mathematics 2016-10-25 Javier Zúñiga

We give a proof of Kontsevich's formality theorem for a general manifold using Fedosov resolutions of algebras of polydifferential operators and polyvector fields. The main advantage of our construction of the formality quasi-isomorphism is…

Quantum Algebra · Mathematics 2007-05-23 Vasiliy Dolgushev

We prove that any quasirandom uniform hypergraph $H$ can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our results also apply to multipartite hypergraphs and even to the…

Combinatorics · Mathematics 2021-01-22 Stefan Ehard , Felix Joos

In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…

Data Structures and Algorithms · Computer Science 2017-06-29 Caishi Fang

We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…

Geometric Topology · Mathematics 2010-04-13 Jason A. Behrstock , Walter D. Neumann

A graph $G$ is said to be $1$-perfectly orientable if it has an orientation such that for every vertex $v\in V(G)$, the out-neighborhood of $v$ in $D$ is a clique in $G$. In $1982$, Skrien posed the problem of characterizing the class of…

Combinatorics · Mathematics 2016-04-20 Boštjan Brešar , Tatiana Romina Hartinger , Tim Kos , Martin Milanič

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$,…

Geometric Topology · Mathematics 2016-01-20 Abhijit Champanerkar , Ilya Kofman , Neal Stoltzfus

Barot, Geiss and Zelevinsky define a notion of a ``cyclically orientable graph'' and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky's work leaves open the question of giving an efficient…

Combinatorics · Mathematics 2007-05-23 David E Speyer

Genevois introduced and investigated mediangle graphs as a common generalization of median graphs (1-sekeleta of CAT(0) cube complexes) and Coxeter graphs (Cayley graphs of Coxeter systems) and studied groups acting on them. He asked if…

Combinatorics · Mathematics 2025-12-10 Victor Chepoi , Kolja Knauer

In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to…

Quantum Algebra · Mathematics 2014-10-01 James Conant , Karen Vogtmann

The aim of this article is to obtain restrictions on complex orientations of dividing real J-curves of almost-complex manifolds. This problem comes from real algebraic geometry and the main result is a congruence generalising Arnol'd,…

Algebraic Geometry · Mathematics 2007-05-23 Jean-Yves Welschinger

We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…

Combinatorics · Mathematics 2011-11-09 Noga Alon , Ankur Moitra , Benny Sudakov