Before revision:  For sets P of n points in  general position, we show that the bistellar flip graph is ( n-3 )-connected, answering, for sets in general position, an open questions raised in a book (by De Loera, Rambau, and Santos) and a survey (by Lee and Santos). This matches the situation for regular triangulations ( partial triangulations obtained by lifting the points and projecting the lower convex hull ), where (n-3)-connectivity has been known since the 1980s via the secondary polytope ( Gelfand, Kapranov , Zelevinsky ) and Balinski's Theorem.
After revision:  For sets P of n points in general position, we show that the bistellar flip graph is ( n-3 )-connected, and the bistellar flip graph is (n-3)-connected; both results are tight. The latter bound matches the situation for regular triangulations ( partial triangulations obtained by lifting the points and projecting the lower convex hull ), where (n-3)-connectivity has been known since the 1980s via the secondary polytope ( Gelfand, Kapranov , Zelevinsky ) and Balinski's Theorem.