In the past two decades, there have been far-reaching developments in the problem of determining all finite non-abelian simple groups—so much so, that many people now believe that the solution to the… Expand

This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics, as well as suggesting ways to improve the quality of these graphs.Expand

The authors have considerably reworked and expanded their earlier successful books on designs, graphs and codes, into an invaluable textbook that is accessible to any student with a background of undergraduate algebra.Expand

The main results are partial characterizations of countable graphs and posets with this property; an analogue of Fraïssé's theorem; and representations of monoids as endomorphism monoids of such structures.Expand

Preface 1. What is combinatorics? 2. On numbers and counting 3. Subsets, partitions, permutations 4. Recurrence relations and generating functions 5. The principle of inclusion and exclusion 6. Latin… Expand