Related papers: Stirling Decomposition of Graph Homology in Genus …
Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2…
Homology of braid groups and Artin groups can be related to the study of spaces of curves. We completely calculate the integral homology of the family of smooth curves of genus $g$ with one boundary component, that are double coverings of…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
In this paper, we introduce a new method to compute magnitude homology of general graphs. To each direct sum component of magnitude chain complexes, we assign a pair of simplicial complexes whose simplicial chain complex is isomorphic to…
This paper develops a new chain model for the commutative graph complex $\mathsf{GC}_2$ which takes Lie graph homology as an input. Our main technical result is the identification of a large contractible complex of (certain) tadpoles and…
Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded…
Let $p: S\to S_g$ be a finite covering of an orientable closed surface of genus $g$. We prove that, for $g\geq 3$, the rational homology group $H_1(S;{\mathbb Q})$ is generated by cycles supported on simple closed curves $\gamma\subset S$…
We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…
We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…
The balanced chromatic number of a signed graph G is the minimum number of balanced sets that cover all vertices of G. Studying structural conditions which imply bounds on the balanced chromatic number of signed graphs is among the most…
Let $\Gamma_{g,1}^m$ be the mapping class group of the orientable surface $\Sigma_{g,1}^m$ of genus $g$ with one parametrised boundary curve and $m$ permutable punctures; when $m=0$ we omit it from the notation. Let…
Given a permutation group $G$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph with connection set the set of all derangements of $G$. We prove that, when $G$ is transitive of degree at least $3$, $\Gamma_G$ contains a triangle.…
We classify representations of the mapping class group of a surface of genus $g$ (with at most one puncture or boundary component) up to dimension $3g-3$. Any such representation is the direct sum of a representation in dimension $2g$ or…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
A magic labelling of a graph $G$ with magic sum $s$ is a labelling of the edges of $G$ by nonnegative integers such that for each vertex $v\in V$, the sum of labels of all edges incident to $v$ is equal to the same number $s$. Stanley gave…
The moduli space $\bar{M}_S^\sigma(R)$ parameterizes the isomorphism classes of $S$-pointed stable real curves of genus zero which are invariant under relabeling by the involution $\sigma$. This moduli space is stratified according to the…
We present a procedure to sample uniformly from the set of combinatorial isomorphism types of balanced triangulations of surfaces - also known as graph-encoded surfaces. For a given number $n$, the sample is a weighted set of graph-encoded…
Let \Sigma = \Sigma _{g,1} be a compact surface of genus g at least 3 with one boundary component, \Gamma its mapping class group and M = H_1(\Sigma , Z) the first integral homology of \Sigma . Using that \Gamma is generated by the Dehn…
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses,…
We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…