A simple proof of Gagliardi's handle recognition theorem (Q1070584): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Recognizing a 3-dimensional handle among 4-coloured graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Crystallisation moves / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-encoded 3-manifolds / rank | |||
Normal rank | |||
Revision as of 11:49, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof of Gagliardi's handle recognition theorem |
scientific article |
Statements
A simple proof of Gagliardi's handle recognition theorem (English)
0 references
1985
0 references
\textit{C. Gagliardi} [Ric. Mat. 31, 389-404 (1982; Zbl 0547.57017)] has proved a theorem on recognizing handles in 3-manifolds crystallizations. The purpose of the note is to present a short proof of this result and to introduce a more general definition of combinatorial handle, crucial for the proof. The author also presents a crystallization which settles two questions posed in Gagliardi's paper.
0 references
edge-colored graphs
0 references
graph-encoded manifolds
0 references
recognizing handles in 3- manifolds crystallizations
0 references
combinatorial handle
0 references
