A combinatorial proof of a formula for Betti numbers of a stacked polytope.

Choi, Suyoung; Kim, Jang Soo

Displaying similar documents to “A combinatorial proof of a formula for Betti numbers of a stacked polytope.”

Face vectors of two-dimensional Buchsbaum complexes.

Murai, Satoshi (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the connectivity of skeletons of pseudomanifolds with boundary

R. Ayala, M. J. Chávez, Alberto Márquez, Antonio Quintero (2002)

Mathematica Bohemica

Similarity:

In this note we show that $1$ -skeletons and $2$ -skeletons of $n$ -pseudomanifolds with full boundary are $(n + 1)$ -connected graphs and $n$ -connected $2$ -complexes, respectively. This generalizes previous results due to Barnette and Woon.

Connectivity of the lifts of a greedoid.

Tedford, Steven J. (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the doubly connected domination number of a graph

Joanna Cyman, Magdalena Lemańska, Joanna Raczek (2006)

Open Mathematics

Similarity:

For a given connected graph G = (V, E), a set $D \subseteq V (G)$ is a doubly connected dominating set if it is dominating and both 〈D〉 and 〈V (G)-D〉 are connected. The cardinality of the minimum doubly connected dominating set in G is the doubly connected domination number. We investigate several properties of doubly connected dominating sets and give some bounds on the doubly connected domination number.