Minors in random and expanding hypergraphs

DOI10.1145/1998196.1998256zbMath1283.05196OpenAlexW1970176528MaRDI QIDQ5404449

Uli Wagner

Publication date: 24 March 2014

Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1998196.1998256

zbMATH Keywords

thresholdssimplicial complexesembeddingshypergraphsminorsrandom complexes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph minors (05C83) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Finding non-orientable surfaces in 3-manifolds ⋮ On Codimension One Embedding of Simplicial Complexes ⋮ Bounding Helly Numbers via Betti Numbers ⋮ Ramanujan complexes and high dimensional expanders ⋮ On eigenvalues of random complexes ⋮ On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space ⋮ Bipartite rigidity ⋮ Non-embeddability of geometric lattices and buildings ⋮ UPPER BOUND THEOREM FOR ODD‐DIMENSIONAL FLAG TRIANGULATIONS OF MANIFOLDS ⋮ Random Steiner systems and bounded degree coboundary expanders of every dimension ⋮ Unnamed Item