Add experiments/self_flip_neighbor.py: enumerate the admissible flips of a
maximal planar graph and test each for isomorphism to the original, i.e. decide
whether G lies in its own flip neighborhood N(G). Supports a single graph6 input
or an order-range survey over min-degree-5 triangulations.
Add a "self-flip neighbors" section to paper.tex with the n=12..25 survey table
and a remark: the self-flip fraction declines as expected (min-degree-5
triangulations are asymptotically rigid), and this is not useful for narrowing
the minimal criminal since it neither includes nor excludes any candidate.
Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
didericis
b1d681f39e