## About this book

### Introduction

Three things should be considered: problems, theorems, and applications. - Gottfried Wilhelm Leibniz, Dissertatio de Arte Combinatoria, 1666 This book grew out of several courses in combinatorics and graph theory given at Appalachian State University and UCLA in recent years. A one-semester course for juniors at Appalachian State University focusing on graph theory covered most of Chapter 1 and the first part of Chapter 2. A one-quarter course at UCLA on combinatorics for undergraduates concentrated on the topics in Chapter 2 and included some parts of Chapter I. Another semester course at Appalachian State for advanced undergraduates and beginning graduate students covered most of the topics from all three chapters. There are rather few prerequisites for this text. We assume some familiarity with basic proof techniques, like induction. A few topics in Chapter 1 assume some prior exposure to elementary linear algebra. Chapter 2 assumes some familiarity with sequences and series, especially Maclaurin series, at the level typically covered in a first-year calculus course. The text requires no prior experience with more advanced subjects, such as group theory.

### Keywords

Combinatorics Matching Pigeonhole principle Polya Ramsey theory graph theory

#### Authors and affiliations

- John M. Harris
- Jeffry L. Hirst
- Michael J. Mossinghoff

- 1.Department of MathematicsFurman UniversityGreenvilleUSA
- 2.Department of MathematicsAppalachian State UniversityBooneUSA
- 3.Department of MathematicsUCLALos AngelesUSA

### Bibliographic information