The main purpose of this book is to provide help in learning existing techniques in combinatorics. The most effective way of learning such techniques is to solve exercises and problems. This book presents all the material in the form of problems and series of problems (apart from some general comments at the beginning of each chapter).
Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics.
The book explores the concept of greedoids, which emerged from discussions on optimization problems involving independence systems and matroids. The authors identified that the hereditary property of these systems was often unnecessary; instead, a weaker condition called accessibility suffices. This insight led to in-depth investigations into the structures and properties of greedoids, expanding the understanding of optimization beyond traditional boundaries. The work is rooted in mathematical programming and highlights significant theoretical advancements in the field.