Providing a cohesive reference for advanced undergraduates, graduate students and even experienced researchers, this text contains both introductory and advanced material in extremal graph theory, hypergraph theory and Ramsey theory.Along the way, the book includes many modern proof techniques in the field such as the probabilistic method and algebraic methods. Several recent breakthroughs are presented with complete proofs, for example, recent results on the sunflower problem, and off-diagonal and geometric Ramsey theory.It is perhaps unique in containing material on both hypergraph regularity and containers.Featuring an extensive list of exercises, the text is suitable as a teaching text for a variety of courses in extremal combinatorics.Each of the two parts can form the basis of separate courses, and the majority of sections are designed to match the length of a single lecture.