Examples of Inequalities and Estimates

Louis Comtet
Additional contact information
Louis Comtet: University of Paris-Sud

Chapter Chapter VII in Advanced Combinatorics, 1974, pp 268-304 from Springer

Abstract: 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.

Keywords: Asymptotic Expansion; Regular Graph; Triple System; Double Sequence; Steiner Triple System (search for similar items in EconPapers)
Date: 1974
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-010-2196-8_7

Ordering information: This item can be ordered from
http://www.springer.com/9789401021968

DOI: 10.1007/978-94-010-2196-8_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().