Abstract
Everything we’ve been doing in the preceding chapters has been counting combinatorics, that is, combinatorics in which we wish to compute the number of configurations meeting certain criteria. Such problems make up one branch of combinatorics; there are two other classes of problems on which we haven’t even touched. In this chapter we look briefly at these other branches of combinatorics. Some of the subjects introduced here will be covered in greater depth by Tarjan in later chapters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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). Outlook. 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_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1101-1_7
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