A proof of the Gordon Conjecture
classification
🧮 math.GT
keywords
conjecturegordonproofstabilizedcombinatorialheegaardonlysplittings
read the original abstract
A combinatorial proof of the Gordon Conjecture: The sum of two Heegaard splittings is stabilized if and only if one of the two summands is stabilized.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.