Related papers: Complexes of Directed Trees and Independence Compl…
We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used…
A theorem of Ding, Oporowski, Oxley, and Vertigan implies that any sufficiently large twin-free graph contains a large matching, a co-matching, or a half-graph as a semi-induced subgraph. The sizes of these unavoidable patterns are measured…
We show that the independence complex of a chordal graph is contractible if and only if this complex is dismantlable (strong collapsible) and it is homotopy equivalent to a sphere if and only if its core is a cross-polytopal sphere. The…
In 1983 Kalai proved an incredible generalisation of Cayley's formula for the number of trees on a labelled vertex set to a formula for a class of $r$-dimensional simplicial complexes. These simplicial complexes generalise trees by means of…
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…
We show that the independence complex of a tree is contractible if and only if it can be reduced to a path \( P_n \) with \( n \equiv 1 \pmod{3} \) by a sequence of truncation moves at branching points. As a consequence of our method, we…
We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…
Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices…
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…
We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…
There is a forgetful map from the mapping class group of a punctured surface to that of the surface with one fewer puncture. We prove that finitely generated purely pseudo-Anosov subgroups of the kernel of this map are convex cocompact in…
We study two simplicial complexes arising from a directed graph $G = (V, E)$ with two chosen vertices $s$ and $t$: the *path-free complex*, consisting of all subsets $F \subseteq E$ that contain no path from $s$ to $t$, and the…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
Let $P$ be a finite poset with an element $s$ such that (1) for all $x\in P$, either $s\vee x$ or $s\wedge x$ exists; and (2) for all $x,y\in P$ such that $x<y$, if $s\wedge x$ does not exist but $s\wedge y$ does exist, then $(s\wedge…
The pentagram map that associates to a projective polygon a new one formed by intersections of short diagonals was introduced by R. Schwartz and was shown to be integrable by V. Ovsienko, R. Schwartz and S. Tabachnikov. Recently, M. Glick…
We continue the study of $(tw,\omega)$-bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the…
Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…
Quasi-Lie bialgebras are natural extensions of Lie-bialgebras, where the cobracket satisfies the co-Jacobi relation up to some natural obstruction controlled by a skew-symmetric 3-tensor $\phi$. This structure was introduced by Drinfeld…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…