Resolution graphs with 3 or 4 large nodes do not admit QHD smoothings; new combinatorial examples and a new proof of the Bhupal-Stipsicz theorem are given via reduction and enumeration.
Smoothings of normal surface singularities.Topology, 20(3):219–246, 1981
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimal rational graphs admitting a QHD smoothing
Resolution graphs with 3 or 4 large nodes do not admit QHD smoothings; new combinatorial examples and a new proof of the Bhupal-Stipsicz theorem are given via reduction and enumeration.