On Codimension One Embedding of Simplicial Complexes
From MaRDI portal
Publication:4604375
DOI10.1007/978-3-319-44479-6_9zbMath1385.05090arXiv1605.01240OpenAlexW2345697704MaRDI QIDQ4604375
Afshin Goodarzi, Anders Bjoerner
Publication date: 26 February 2018
Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.01240
Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of simplicial complexes (05E45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Hardness of embedding simplicial complexes in \(\mathbb R^d\)
- Obstructions to the imbedding of a complex in a euclidean space. I: The first obstruction
- \(f\)-vectors of 3-manifolds
- An extended Euler-Poincaré theorem
- Shrinking cell-like decompositions of manifolds. Codimension three
- Counting triangle crossings and halving planes
- Extremal problems for geometric hypergraphs
- On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space
- On minimal complexes
- A Nonpolyhedral Triangulated Mobius Strip
- Lectures on Polytopes
- Non-Separable and Planar Graphs
- René Thom’s work on geometric homology and bordism
- Minors in random and expanding hypergraphs
- Toward a theory of crossing numbers
- Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes
- Komplexe in euklidischen Räumen
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
This page was built for publication: On Codimension One Embedding of Simplicial Complexes
