Related papers: Simplicial cycles and the computation of simplicia…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…
Visibility graph of a simple polygon is a graph with the same vertex set in which there is an edge between a pair of vertices if and only if the segment through them lies completely inside the polygon. Each pair of adjacent vertices on the…
In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…
The tree complex is a simplicial complex defined in recent work of Belk, Lanier, Margalit, and Winarski with natural applications to mapping class groups and complex dynamics. In this article, we connect this setting with the study of…
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…
We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled…
The sandpile group of a connected graph is a finite abelian group whose cardinality is the number of spanning trees in the graph. We compute the spanning tree number and sandpile group structure for the cone over a bi-coconut tree,…
We explore resolutions of monomial ideals supported by simplicial trees. We argue that since simplicial trees are acyclic, the criterion of Bayer, Peeva and Sturmfels for checking if a simplicial complex supports a free resolution of a…
In this note, working in the context of simplicial sets, we give a detailed study of the complexity for computing chain level Steenrod squares, in terms of the number of face operators required. This analysis is based on the combinatorial…
We present a short proof of Reisner's Theorem, characterizing which simplicial complexes have a Cohen-Macaulay face ring. In some cases, we can also express some homological invariants of the face ring in terms of the reduced homology of…
We first construct the total simplicial complex (TSC) of a finite simple graph $G$ in order to generalize the total graph $T(G)$. We show that $\Delta_T(G)$ is not Cohen-Macaulay (CM) in general. For a connected graph $G$, we prove that the…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
Motivated by an application in condensed matter physics and quantum information theory, we prove that every non-null even-hole-free claw-free graph has a simplicial clique, that is, a clique $K$ such that for every vertex $v \in K$, the set…
Theoretical development and applications of graph signal processing (GSP) have attracted much attention. In classical GSP, the underlying structures are restricted in terms of dimensionality. A graph is a combinatorial object that models…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
This is an expository paper. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is contained in an even number of edges from $C$. E.g., a cycle in the sense of graph theory is a $1$-cycle, but not vice versa. It is easy to…
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…