1. Kernels: Annotated, proper and induced;Abu-Khzam,2006
2. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas;Aharoni;J. Combin. Theory Ser. A,1986
3. Solving MAX-k-SAT above a tight lower bound;Alon;Algorithmica,2011
4. The Probabilistic Method;Alon,2000
5. H.K. Büning, O. Kullmann, Minimal Unsatisfiability and Autarkies, Handbook of Satisfiability, pp. 339–401, http://dx.doi.org/10.3233/978-1-58603-929-5-339, chapter 11.