Related papers: A generalized lower bound theorem for balanced man…

In 1987, Stanley conjectured that if a centrally symmetric Cohen--Macaulay simplicial complex $\Delta$ of dimension $d-1$ satisfies $h_i(\Delta)=\binom{d}{i}$ for some $i\geq 1$, then $h_j(\Delta)=\binom{d}{j}$ for all $j\geq i$. Much more…

Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$,…

We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum…

Let $M$ be any compact four-dimensional PL-manifold with or without boundary (e.g. the four-dimensional sphere or ball). Consider the space $T(M)$ of all simplicial isomorphism classes of triangulations of $M$ endowed with the metric…

This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…

A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…

The $g$-theorem is a momentous result in combinatorics that gives a complete numerical characterization of the face numbers of simplicial convex polytopes. The $g$-conjecture asserts that the same numerical conditions given in the…

We resolve a conjecture of Kalai asserting that the $g_2$-number of any simplicial complex $\Delta$ that represents a connected normal pseudomanifold of dimension $d\geq 3$ is at least as large as ${d+2 \choose 2}m(\Delta)$, where…

We study face numbers of simplicial complexes that triangulate manifolds (or even normal pseudomanifolds) with boundary. Specifically, we establish a sharp lower bound on the number of interior edges of a simplicial normal pseudomanifold…

We study lower bounds for the number of vertices in a PL-triangulation of a given manifold $M$. While most of the previous estimates are based on the dimension and the connectivity of $M$, we show that further information can be extracted…

This paper is concerned with lower bounds for the connectivity of graphs (one-dimensional skeleta) of triangulations of compact manifolds. We introduce a structural invariant b_M for simplicial d-manifolds M taking values in the range 0 <=…

The class of $(d-1)$-dimensional Buchsbaum* simplicial complexes is studied. It is shown that the rank-selected subcomplexes of a (completely) balanced Buchsbaum* simplicial complex are also Buchsbaum*. Using this result, lower bounds on…

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

(d+1)-colored graphs, i.e. edge-colored graphs that are (d+1)-regular, have already been proved to be a useful representation tool for compact PL d-manifolds, thus extending the theory (known as crystallization theory) originally developed…

Let $\Delta$ be a $d$-dimensional normal pseudomanifold, $d \ge 3.$ A relative lower bound for the number of edges in $\Delta$ is that $g_2$ of $\Delta$ is at least $g_2$ of the link of any vertex. When this inequality is sharp $\Delta$ has…

This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…

The aim of this note is twofold. On the one hand, we present a streamlined version of Molloy's new proof of the bound $\chi(G) \leq (1+o(1))\Delta(G)/\ln \Delta(G)$ for triangle-free graphs $G$, avoiding the technicalities of the entropy…

A closed connected hyperbolic $n$-manifold bounds geometrically if it is isometric to the geodesic boundary of a compact hyperbolic $(n+1)$-manifold. A. Reid and D. Long have shown by arithmetic methods the existence of infinitely many…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

The face numbers of simplicial complexes without missing faces of dimension larger than $i$ are studied. It is shown that among all such $(d-1)$-dimensional complexes with non-vanishing top homology, a certain polytopal sphere has the…