A proof of Kühnel's conjecture for \(n\geq k^ 2+3k\)
From MaRDI portal
Publication:1359360
DOI10.1007/BF03322172zbMath0887.52007WikidataQ123002796 ScholiaQ123002796MaRDI QIDQ1359360
Publication date: 6 May 1998
Published in: Results in Mathematics (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Triangulating manifolds (57Q15)
Cites Work
- Rigidity and the lower bound theorem. I
- Manifolds which are like projective planes
- Combinatorial manifolds with few vertices
- Tight polyhedral submanifolds and tight triangulations
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- On the Number of Vertices of a Convex Polytope
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item