Extremal Finite Set Theory surveys old and new results in this subject. It presents an overview of the main techniques and tools (shifting, cycle method, profile polytopes, incidence matrices, combinatorial nullstellensatz, etc.) used in the different subtopics. 

Introduction to Chemical Graph Theory is a concise introduction to the main topics and techniques in chemical graph theory, specifically the theory of topological indices. The book covers some of the most commonly used mathematical approaches in the subject. 

Additive Combinatorics: A Menu of Research Problems is the first book of its kind in aims and scope: it provides readers with an opportunity to actively explore the relatively new field of additive combinatorics. The author has written it specifically for students of any background and proficiency level, from beginners to advanced researche

This is the first book that focuses on the intersection of graph searching games and probabilistic methods. The book explores various applications of these powerful mathematical tools to games and processes. It also provides results, techniques, and directions in graph searching games from the point of view of probabilistic methods.

The first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and comput

Bijective proofs are some of the most elegant and powerful techniques in all of mathematics. Suitable for readers without prior background in algebra or combinatorics, the book presents an introduction to enumerative and algebraic combinatorics emphasizing bijective methods.

This book focuses on symmetric groups and representation theory. The symmetric group is a central object in discrete mathematics. It can be studied from a combinatorial, algorithmic, or algebraic viewpoint, and the results can be applied in a plethora of other fields, such as physics and computer science. This book is the most up-to-date one on

The purpose of this undergraduate textbook is to offer all the material suitable for a beginning combinatorics course for students in STEM subjects particularly mathematics and computer science, although other subjects may benefit as well. This will be achieved through the use of plentiful (though brief) examples, and a variety of exercises and

This comprehensive text features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. It covers the major areas of graph theory, including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions

This book is designed to be usable as a textbook for an undergraduate course or for an advanced graduate course in coding theory as well as a reference for researchers in discrete mathematics, engineering and theoretical computer science. This second edition has three parts: an elementary introduction to coding, theory and applications of codes,