Abstract
In the preceding chapters we have established explicit formulas for counting sets. The sets we wanted to count were of the following type: a finite set N with n elements is given, and then we studied sets of combinatorial objects bound to N that satisfied some additional conditions. If these conditions are not simple, then the explicit formula is usually not simple either, difficult to obtain, and little efficient. It can often be replaced advantageously by upper and lower bounds. Evidently, the closer these bounds fit, the better.
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
© 1974 D. Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Comtet, L. (1974). Examples of Inequalities and Estimates. In: Advanced Combinatorics. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-2196-8_7
Download citation
DOI: https://doi.org/10.1007/978-94-010-2196-8_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-2198-2
Online ISBN: 978-94-010-2196-8
eBook Packages: Springer Book Archive