Related papers: Differentials on Forested and Hairy Graph Complexe…
In 2020, we initiated a systematic study of graph classes in which the treewidth can only be large due to the presence of a large clique, which we call $(\mathrm{tw},\omega)$-bounded. While $(\mathrm{tw},\omega)$-bounded graph classes are…
In this paper, we explicitly determine the automorphism group of every nonhyperelliptic superspecial curve of genus $4$ over $\mathbb{F}_{11}$. Our algorithm determining automorphism groups works for any nonhyperelliptic curves of genus $4$…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and…
We introduce a graph-theoretical interpretation of an induced action of Aut$(\Gamma)$ in the discrete de Rham cohomology of a finite graph $\Gamma$. This action produces a splitting of Aut$(\Gamma)$ that depends on the cycles of $\Gamma$.…
An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…
Given a smooth foliation on a closed manifold, basic forms are differential forms that can be expressed locally in terms of the transverse variables. The space of basic forms yields a differential complex, because the exterior derivative…
For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the…
By coloring a signed graph by signed colors, one obtains the signed chromatic polynomial of the signed graph. For each signed graph we construct graded cohomology groups whose graded Euler characteristic yields the signed chromatic…
We prove the existence of an automorphism-invariant coupling for the wired and the free uniform spanning forests on Cayley graphs of finitely generated residually amenable groups.
We study higher Hochschild homology evaluated on wedges of circles, viewed as a functor on the category of free groups. The main results use coefficients arising from square-zero extensions; this is motivated by work of Turchin and…
We give a characterisation of quantum automorphism groups of trees. In particular, for every tree, we show how to iteratively construct its quantum automorphism group using free products and free wreath products. This can be considered a…
Let $D$ be a multidigraph. We study the simplicial complex $\mathrm{Dlf}(D)$, whose vertices are the directed edges of $D$ and whose faces correspond to directed linear forests, that is, vertex-disjoint unions of directed paths. We also…
The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like representation termed parse tree or cotree. In this paper,…
The purpose of this paper is to investigate the relationship between hairy graph complexes associated to cyclic operads and their counterparts for operads (and, more generally, dioperads). This is based on the author's interpretation of…
This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…
The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-isomorphic graphs is valuable. In this paper, a new method is…
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph…
We study Steiner Forest on $H$-subgraph-free graphs, that is, graphs that do not contain some fixed graph $H$ as a (not necessarily induced) subgraph. We are motivated by a recent framework that completely characterizes the complexity of…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…