{"paper":{"title":"Connectivity of triangulations without degree one edges under 2-3 and 3-2 moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Henry Segerman","submitted_at":"2016-05-30T04:18:20Z","abstract_excerpt":"Matveev and Piergallini independently showed that, with a small number of known exceptions, any triangulation of a three-manifold can be transformed into any other triangulation of the same three-manifold with the same number of vertices, via a sequence of 2-3 and 3-2 moves. We can interpret this as showing that the Pachner graph of such triangulations is connected. In this paper, we extend this result to show that (again with a small number of known exceptions), the subgraph of the Pachner graph consisting of triangulations without degree one edges is also connected, for single-vertex triangu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09099","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}