Abstract
For the most part the notes that comprise this text differ only slightly from those provided to the students during the course. The notes have been merged into a single paper, a few sections have been made more detailed, and various corrigenda have been incorporated. The midterm and final examinations are included in their proper chronological places within the text (chapters 8 and 15), together with the solutions. The only information omitted from this book is that regarding the mechanics of the course—office hours, grading criteria, etc. Homework assignments are included, as they often led to further discussion in the notes. Lecture dates are included to give a feel for the pace at which material was covered, though it should be noted that much of the material in the notes was not actually presented in the lectures, being instead drawn from supplementary notes provided by the instructors or supplied by the author as the notes were written.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this chapter
Cite this chapter
Pólya, G., Tarjan, R.E., Woods, D.R. (1983). Introduction. In: Notes on Introductory Combinatorics. Progress in Computer Science, vol 4. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-1101-1_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1101-1_1
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-3170-3
Online ISBN: 978-1-4757-1101-1
eBook Packages: Springer Book Archive