Minors in random and expanding hypergraphs

DOI10.1145/1998196.1998256MaRDI QIDQ5404449zbMATH OpenOpenAlexFDO

Authors 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

simplicial complexesembeddingsthresholdshypergraphsminorsrandom complexes

Mathematics Subject Classification ID

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

Recommendations

• Minors, embeddability, and extremal problems for hypergraphs
• On topological minors in random simplicial complexes
• The threshold for integer homology in random \(d\)-complexes
• Topological embeddings into random 2‐complexes
• When does the top homology of a random simplicial complex vanish?

Cited in

(14)

• Maps on random hypergraphs and random simplicial complexes
• Minors, embeddability, and extremal problems for hypergraphs
• Bipartite rigidity
• Random Steiner systems and bounded degree coboundary expanders of every dimension
• Ramanujan complexes and high dimensional expanders
• On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space
• Simplicial homeomorphs and trace-bounded hypergraphs
• On multiplicative \(\lambda\)-approximations and some geometric applications
• Non-embeddability of geometric lattices and buildings
• Simplicial branching random walks
• Bounding Helly numbers via Betti numbers
• Finding non-orientable surfaces in 3-manifolds
• Upper bound theorem for odd-dimensional flag triangulations of manifolds
• On codimension one embedding of simplicial complexes

This page was built for publication: Minors in random and expanding hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404449)