On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space

DOI10.1007/s00454-017-9936-1zbMath1405.57036arXiv1512.05164OpenAlexW2963587052MaRDI QIDQ1745202

Salman Parsa

Publication date: 20 April 2018

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.05164

zbMATH Keywords

embeddingsimplicial complexlinkless embeddingKovari-Sos-Turań Theorem

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Embeddings and immersions in PL-topology (57Q35) Combinatorial complexity of geometric structures (52C45)

Related Items

Correction to: ``On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space, On Codimension One Embedding of Simplicial Complexes, A short exposition of Salman Parsa's theorems on intrinsic linking and non-realizability, Geometry and the simplex: results, questions and ideas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• On counting triangulations in \(d\) dimensions
• Counting triangle crossings and halving planes
• The extremal function for complete minors
• Sachs' linkless embedding conjecture
• Combinatorics and commutative algebra.
• Some Ramsey-type results on intrinsic linking of \(n\)-complexes
• On extremal problems of graphs and generalized graphs
• Homomorphiesätze für Graphen
• Imbeddings of simplicial complexes
• Lectures on Polytopes
• Embedding products of graphs into Euclidean spaces
• Topological cliques in graphs II
• Minors in random and expanding hypergraphs
• Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes
• The maximum numbers of faces of a convex polytope
• Approximating Embeddings of Polyhedra In Codimension Three
• Imbedding Classes and n-Minimal Complexes
• 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