Related papers: Some combinatorial properties of flag simplicial p…
Most applications of the hard Lefschetz theorem related to combinatorial properties of simplicial complexes involve their $h$-vectors. In the context of positivity properties involving $h$-vectors of flag spheres, $f$-vectors with a…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…
A flag domain $D$ is an open orbit of a real form $G_0$ in a flag manifold $Z=G/P$ of its complexification. If $D$ is holomorphically convex, then, since it is a product of a Hermitian symmetric space of bounded type and a compact flag…
Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit…
We study $h$-vectors of simplicial complexes which satisfy Serre's condition ($S_r$). We say that a simplicial complex $\Delta$ satisfies Serre's condition ($S_r$) if $\tilde H_i(\lk_\Delta(F);K)=0$ for all faces $F \in \Delta$ and for all…
Every graph $G$ can be represented by a collection of equi-radii spheres in a $d$-dimensional metric $\Delta$ such that there is an edge $uv$ in $G$ if and only if the spheres corresponding to $u$ and $v$ intersect. The smallest integer $d$…
We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…
In this note we prove that the number of combinatorial types of $d$-polytopes with $d+1+\alpha$ vertices and $d+1+\beta$ facets is bounded by a constant independent of $d$.
In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…
We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial…
We show that there are $f$-vectors of balanced simplicial complexes giving a source of simplicial complexes exhibiting a Boolean decomposition similar to a geometric Lefschetz decomposition. The objects we are working with are $h$-vectors…
We show that the $\gamma$-vector of the order complex of any polytope is the f-vector of a balanced simplicial complex. This is done by proving this statement for a subclass of Stanley's S-shellable spheres which includes all polytopes. The…
Let G be a simple balanced bipartite graph on $2n$ vertices, $\delta = \delta(G)/n$, and $\rho={\delta + \sqrt{2 \delta -1} \over 2}$. If $\delta > 1/2$ then it has a $\lfloor \rho n \rfloor$-regular spanning subgraph. The statement is…
In this paper we study the structure of cellular pseudomanifolds (aka abstract polytopes). These are natural combinatorial generalisations of polytopal spheres (i.e., boundary complexes of convex polytopes). This class is closed under…
Abstract polytopes generalize the face lattice of convex polytopes. A polytope is semiregular if its facets are regular and its automorphism group acts transitively on its vertices. In this paper we construct semiregular, facet-transitive…
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…
For any semifield K we define a K-form of a partial flag manifold of a semisimple group G of simply laced type over the complex numbers. The definition is in terms of the theory of canonical bases.
We prove that for any prime homology $(d-1)$-sphere $\Delta$ of dimension $d-1\geq 3$ and any edge $e\in S$, the graph $G(\Delta)-e$ is generically $d$-rigid. This confirms a conjecture of Nevo and Novinsky.