Putting convex \(d\)-polytopes inside frames

DOI10.1007/s00022-018-0433-3zbMath1406.52027OpenAlexW2804141921MaRDI QIDQ2413557

Joseph Zaks

Publication date: 14 September 2018

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00022-018-0433-3

zbMATH Keywords

neighborly familiesrods and framesnearly-neighborly families

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Three-dimensional polytopes (52B10)

Related Items (2)

Two neighborly families of 3-pyramids and of 3-boxes in \(E^{3}\) ⋮ Neighborly families in \(E^d\) consisting of either \(d\)-pyramids over \((d-1)\)-cubes, or else of \(d\)-cubes

Cites Work

• Bounds on the cardinalities of families of nearly neighborly quadrilaterals
• Decomposition of product graphs into complete bipartite subgraphs
• Arbitrarily large neighborly families of symmetric convex polytopes
• Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
• Bounds of neighborly families of convex polytopes
• Neighborly families of \(2^ k\) k-simplices in \(E^ k\).
• No nine neighborly tetrahedra exist
• A Conjecture Concerning Neighboring Tetrahedra
• How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Putting convex \(d\)-polytopes inside frames