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

embeddingshypergraphsminorsrandom complexessimplicial complexesthresholds

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)

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

(17)

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

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)