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 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 Xk (n, p). By definition, such a complex has n vertices, a complete (k − 1)-dimensional skeleton, and every possible k-dimensional simplex is chosen independently with probability p. We show that for every k, t ≥ 1, there is a constant C = C(k, t) such that for p ≥ C/n, the random complex Xk (n, p) asymptotically almost surely contains Kk t (the complete k-dimensional complex on t vertices) as a homological minor. As corollary, the threshold for (topological) embeddability of Xk (n, p) into R2k is at p = Θ(1/n). The method can be extended to other models of random complexes (for which t...

• Type: Journal
• Year: 2011
• Where: COMPGEOM
• Authors: Uli Wagner
• Keywords: COMPGEOM 2011, Continuous Maps, Discrete Geometry, Graph Theory, Simplicial Complexes