A proof of Kühnel's conjecture for n k^ 2+3k
From MaRDI portal
The Kühnel's conjecture for combinatorial 2k-manifolds has been established by W. Kühnel and U. Brehm if the number \(n\) of vertices of M satisfies either \(n \leq 3k + 3\) or \(n \geq k^2 + 4k + 3\). In this paper, the author improves this result by showing that the conjecture is true for \(n \geq k^2 + 3 k\) and so he obtains as a corollary that the statement in the conjecture is true for \(k = 1\) and \(k = 2\).
Recommendations
Cites work
- Combinatorial manifolds with few vertices
- scientific article; zbMATH DE number 15492 (Why is no real title available?)
- scientific article; zbMATH DE number 665691 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- Manifolds which are like projective planes
- On the Number of Vertices of a Convex Polytope
- Rigidity and the lower bound theorem. I
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- Tight polyhedral submanifolds and tight triangulations
Cited in
(6)- A quick proof that \(K_{10}\neq{}P+P+P\)
- scientific article; zbMATH DE number 6712560 (Why is no real title available?)
- A Non-Iterative 2-Adic Statement of the 3N + 1 Conjecture
- THE INEQUALITY cn(PSL(n, K) < 4 HOLDS FOR n = 2,3 AND INFINITE FIELD K
- Tight combinatorial manifolds and graded Betti numbers
- Triangulations with few vertices of manifolds with non-free fundamental group
This page was built for publication: A proof of Kühnel's conjecture for \(n\geq k^ 2+3k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1359360)