This blog post discusses combinatorial designs, building from previous topics on finite geometry and Steiner systems. It defines general Steiner systems and introduces the concept of combinatorial designs, illustrating the relationship between them. It also touches on the existence of designs and a significant theorem by Peter Keevash regarding necessary conditions and their sufficiency for the existence of specific designs.