A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Minors in random and expanding hypergraphs
2011
Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG '11
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 extremal problems for sparse simplicial complexes and the corresponding threshold problems for random complexes. In this paper, we focus on threshold problems. The basic model for random complexes is the Linial-Meshulam model X k (n, p). By definition, such a complex has n vertices, a complete (k − 1)-dimensional skeleton,
doi:10.1145/1998196.1998256
dblp:conf/compgeom/Wagner11
fatcat:unq53imjuramndjovjaxwkgdbq