Related papers: Enumerating the class of minimally path connected …
A simplicial complex is $r$-conic if every subcomplex of at most $r$ vertices is contained in the star of a vertex. A $4$-conic complex is simply connected. We prove that an $8$-conic complex is $2$-connected. In general a $(2n+1)$-conic…
Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $\Delta_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes…
We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…
We define and study a simplicial complex which is a homogeneous space for the group $PGL(2, K)$ over a two-dimensional local field $K$. The complex is a generalization of the tree studied by F. Bruhat, J. Tits, J.-P. Serre and P. Cartier in…
Arthur Cayley famously proved that there are n to the power n-2 labeled trees on n vertices. Here we go much further and show how to enumerate, fully automatically, labeled trees such that every vertex has a number of neighbors that belongs…
Within the framework of generalized combinatorial approach, complexity is determined as a disorder measure for hierarchical statistical ensembles related to Cayley trees possessing arbitrary branching and number of levels. With…
We prove that a connected simplicial complex is uniquely determined by its complex of discrete Morse functions. This settles a question raised by Chari and Joswig. In the 1-dimensional case, this implies that the complex of rooted forests…
For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…
A new very simple proof of the number of labeled rooted forest-graphs with a given number of vertices is given. As a partial case of this formula we have Cayley's formula.
In this paper, we give a new and efficient algebraic criterion for the pure as well as non-pure shellability of simplicial complex $\Delta$ over [n]. We also give an algebraic characterization of a leaf in a simplicial complex (defined in…
We provide a new derivation of the well-known generating function counting the number of walks on a regular tree that start and end at the same vertex, and more generally, a generating function for the number of walks that end at a vertex a…
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…
Let X be a simplicial complex on the vertex set V. The rational Leray number L(X) of X is the minimal d such that the rational reduced homology of any induced subcomplex of X vanishes in dimensions d and above. Let \pi be a simplicial map…
Kalai conjectured that every $n$-vertex $r$-uniform hypergraph with more than $\frac{t-1}{r} {n \choose r-1}$ edges contains all tight $r$-trees of some fixed size $t$. We prove Kalai's conjecture for $r$-partite $r$-uniform hypergraphs.…
We find surprisingly simple formulas for the limiting probability that the rank of a randomly selected vertex in a randomly selected phylogenetic tree or generalized phylogenetic tree is a given integer.
We give a short proof of the fact that the number of labelled trees on $n$ vertices is $n^{n-2}$. Although many short proofs are known, we have not seen this one before.
We introduce a natural class of models of random chain complexes of real vector spaces that some classical ensembles of random matrices, the length $1$ case. We are interested here in the homological properties of these random complexes.…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
Given a shifted order ideal $U$, we associate to it a family of simplicial complexes $(\Delta_t(U))_{t\geq 0}$ that we call squeezed complexes. In a special case, our construction gives squeezed balls that were defined and used by Kalai to…
The fundamental group of the $2$-dimensional Linial-Meshulam random simplicial complex $Y_2(n,p)$ was first studied by Babson, Hoffman and Kahle. They proved that the threshold probability for simple connectivity of $Y_2(n,p)$ is about…