Discrete Mathematics for Computer Science

Preface xxiii

Connected Graphs

The Konigsberg Bridge Problem

Trees

Spanning Trees

Chapter 7: Counting and Combinatorics (4 lectures)
Counting Principles
Permutations and Combinations
Permutations and Combinations with Repetitions
In both sample syllabi the number of lectures committed to material should leave time
for two or three exams and for review days. In addition, instructors should find time to
spend a full day on problems of special interest without being forced to give up material
from the outline.

Help Requested

The authors have tried their best to make the text as error-free as possible. Needless to say,
we are not perfect and likely have missed some problems that really need to be corrected
to improve the text. We would appreciate it very much if any errors would be brought
to our attention. (We intend to provide a small reward for the first notice of any problem
brought to our attention.) Send comments to [email protected] along with your snail-
mail address. We will acknowledge any help we receive and let you know if anyone else
has already noticed the problem you uncovered. We will be very grateful for any help we
receive as we intend to make this text the best learning tool we can. A collection of the
changes we make will be posted at http://www.eg.bucknell.edu/-discrete/errorfile.pdf.

Gary Haggard

John Schlipf

Sue Whitesides