Sciweavers

COMPGEOM
2011
ACM
13 years 4 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
COMBINATORICS
1999
92views more  COMBINATORICS 1999»
14 years 3 days ago
Nim-Regularity of Graphs
Abstract. Ehrenborg and Steingr
Nathan Reading
JSC
2007
84views more  JSC 2007»
14 years 9 days ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
DM
2007
101views more  DM 2007»
14 years 12 days ago
Threshold graphs, shifted complexes, and graphical complexes
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
Caroline J. Klivans
EJC
2006
14 years 13 days ago
The topology of the independence complex
We introduce a large self-dual class of simplicial complexes for which we show that each member complex is contractible or homotopy equivalent to a sphere. Examples of complexes i...
Richard Ehrenborg, Gábor Hetyei
DCG
2006
127views more  DCG 2006»
14 years 14 days ago
The Angle Defect for Odd-Dimensional Simplicial Manifolds
In a 1967 paper, Banchoff stated that a certain type of polyhedral curvature, that applies to all finite polyhedra, was zero at all vertices of an odd-dimensional polyhedral manifo...
Ethan D. Bloch
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
14 years 4 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman
SIGGRAPH
2000
ACM
14 years 4 months ago
As-rigid-as-possible shape interpolation
We present an object-space morphing technique that blends the interiors of given two- or three-dimensional shapes rather than their boundaries. The morph is rigid in the sense tha...
Marc Alexa, Daniel Cohen-Or, David Levin