Related papers: Vertex decomposability of complexes associated to …

We consider collections of disjoint simple closed curves in a compact orientable surface which decompose the surface into pairs of pants. The isotopy classes of such curve systems form the vertices of a 2-complex, whose edges correspond to…

Let $K$ be a field and $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$. Let $\Delta$ be a simplicial complex on $n$ vertices and $I=I_{\Delta}$ be its Stanley-Reisner ideal. In this paper, we show that if $I$…

A well-known conjecture of Simon (1994) states that any pure $d$-dimensional shellable complex on $n$ vertices can be extended to $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the $(n-1)$-dimensional simplex, by attaching one facet at a time…

Using a recent description of the geometric stability manifold, we show the geometric stability manifold associated to any smooth projective complex surface is contractible. We then use this result to demonstrate infinitely many new…

The status of a vertex $v$ in a connected graph is the sum of the distances from $v$ to all other vertices. The status sequence of a connected graph is the list of the statuses of all the vertices of the graph. In this paper we investigate…

We consider packing tree degree sequences in this paper. We set up a conjecture that any arbitrary number of tree degree sequences without common leaves have edge disjoint tree realizations. This conjecture is known to be true for $2$ and…

This paper expands on and refines some known and less well-known results about the finite subset spaces of a simplicial complex $X$ including their connectivity and their top homology groups. It also discusses the inclusion of the…

Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…

We reprove and generalize in a combinatorial way the result of A. Bj\"orner [J.\ Comb.\ Th.\ A {\bf 30}, 1981, pp.~90--100, Theorem 3.3], that order complexes of noncomplemented lattices are contractible, namely by showing that these…

We deal with the problem of decomposing a complete geometric graph into plane star-forests. In particular, we disprove a recent conjecture by Pach, Saghafian and Schnider by constructing for each $n$ a complete geometric graph on $n$…

Extremality and irreducibility constitute fundamental concepts in mathematics, particularly within tropical geometry. While extremal decomposition is typically computationally hard, this article presents a fast algorithm for identifying the…

Given a finite undirected graph $X$, a vertex is $0$-dismantlable if its open neighbourhood is a cone and $X$ is $0$-dismantlable if it is reducible to a single vertex by successive deletions of $0$-dismantlable vertices. By an iterative…

In this paper, we show that every planar graph without $4$-cycles and $6$-cycles has a partition of its vertex set into two sets, where one set induces a forest, and the other induces a forest with maximum degree at most $2$ (equivalently,…

This is a continuation of a previous study initiated by one of us on nonlocal vertex bialgebras and smash product nonlocal vertex algebras. In this paper, we study a notion of right $H$-comodule nonlocal vertex algebra for a nonlocal vertex…

One can define what it means for a compact manifold with corners to be a "contractible manifold with contractible faces." Two combinatorially equivalent, contractible manifolds with contractible faces are diffeomorphic if and only if their…

A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…

Arboricity is a graph parameter akin to chromatic number, in that it seeks to partition the vertices into the smallest number of sparse subgraphs. Where for the chromatic number we are partitioning the vertices into independent sets, for…

In this work we characterize branch data of branched coverings of even degree over the projective plane which are realizable by indecomposable branched coverings.

Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a…

Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…