Lecture 7: Fix for proof of Erdős-Nagy Theorem; characterizations of flat-foldable single-vertex crease patterns and mountain-valley patterns; continuous foldability of single-vertex patterns; linear-time algorithm for local foldability; NP-hardness of global foldability
Page 3: Characterization of flat-foldable single-vertex mountain-valley patterns: Maekawa's Theorem, Kawasaki's Second Theorem, Hull's generalization, counting and decision algorithms
Tom Hull's papers on The Combinatorics of Flat Folds: a Survey and Counting Mountain-Valley Assignments for Flat Folds cover several of these results.
These are rough, personal lecture notes handwritten by Erik Demaine used during lecture. Their primary purpose is for reading/review by students of the class.