scientific article; zbMATH DE number 3888434
[For the entire collection see Zbl 0549.00001.] A family of d-simplices in \(E^ d\) is called neighborly if every pair of them has a (d-1)-dimensional intersection. Let f(d) denote the maximum number of d-simplices in a neighborly family in \(E^ d\). \textit{J. Zaks} showed \(f(d)\geq 2^ d\) [Geom. Dedicata 11, 505-507 (1981; Zbl 0469.51016)] and \(f(d)\leq (2/3)(d+1)!\) [ibid. 8, 279-296 (1979; Zbl 0418.52012)]. The author improves the upper bound to \(f(d)\leq 2^{d+1}\). By a remark of J. Zaks at the end of this paper the essential part of the elegant proof traces back to a paper by B. Alspach, O. T. Ollman and K. B. Reid jun.
- Arbitrarily large neighborly families of symmetric convex polytopes
- Inequalities for two set systems with prescribed intersections
- Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
- Neighborly families in E^d consisting of either d-pyramids over (d-1)-cubes, or else of d-cubes
- No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\)
- Nearly neighbourly families of standard boxes
- Two neighborly families of 3-pyramids and of 3-boxes in \(E^{3}\)
- No nine neighborly tetrahedra exist
- Revisiting the 2d neighborly d-simplices in E^d
- New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)
- On the number of neighborly simplices in \(\mathbb{R}^d\)
- Nonrational configurations, polytopes, and surfaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222785)