Related papers: Shellability of complexes of directed trees

A method for considering a weighted directed graph with an accuracy of up to a given partition of the set of vertices is proposed. The resulting digraph (the splitting graph) does not contain arcs inside each partition element, and the arcs…

The phase diagram of the collapse of a two-dimensional infinite branched polymer interacting with the solvent and with itself through contact interactions is studied from the $q\to 1$ limit of an extension of the $q-$ states Potts model.…

To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. In this article we prove a sufficient numerical condition on the splice diagram for a graph manifold to be a singularity link.…

A discrete d-manifold is a finite simple graph G=(V,E) where all unit spheres are (d-1)-spheres. A d-sphere is a d-manifold for which one can remove a vertex to make it contractible. A graph is contractible if one can remove a vertex with…

A directed cycle double cover of a graph G is a family of cycles of G, each provided with an orientation, such that every edge of G is covered by exactly two oppositely directed cycles. Explicit obstacles to the existence of a directed…

Let L be a lattice admitting a left-modular chain of length r, not necessarily maximal. We show that if either L is graded or the chain is modular, then the (r-2)-skeleton of L is vertex-decomposable (hence shellable). This proves a…

In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a…

The complete symmetric directed graph of order $v$, denoted $K_{v}^*$, is the directed graph on $v$ vertices that contains both arcs $(x,y)$ and $(y,x)$ for each pair of distinct vertices $x$ and $y$. For a given directed graph, $D$, the…

We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree…

We introduce a notion of lexicographic shellability for pure, balanced boolean cell complexes, modelled after the $CL$-shellability criterion of Bj\"orner and Wachs for posets and its generalization by Kozlov called $CC$-shellability. We…

We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph $G$ on $n$ vertices has at most $(1/n^{2}) \prod_{v \in V(G)} (d(v)+1)$ spanning trees. This result is tight…

Explainable clustering by axis-aligned decision trees was introduced by Moshkovitz et al. (2020) and has gained considerable interest. Prior work has focused on minimizing the price of explainability for specific clustering objectives,…

A Euclidean oriented matroid program yields a partial ordering of the cocircuits of its cocircuit graph. We show that every linear extension of that ordering yields a topological sweep and induces a recursive atom-ordering (a shelling of…

This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…

A directed polymer is allowed to branch, with configurations determined by global energy optimization and disorder. A finite size scaling analysis in 2D shows that, if disorder makes branching more and more favorable, a critical transition…

Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…

Let $f:\mathbb{C}^2 \to \mathbb{C}$ be a polynomial map. Let $\mathbb{C}^2 \subset X$ be a compactification of $\mathbb{C}^2$ where $X$ is a smooth rational compact surface and such that there exists a morphism of varieties $\Phi :X\to…

In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Tur\'an's famous theorem. We consider the implications of the connectivity property of…

Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…

Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we develop new recursive formulas for counting linear extensions of…