Appropriate for one- or two-semester, junior- to senior-level combinatorics courses. This trusted best-seller covers the key combinatorial ideas--including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (m...
Appropriate for one- or two-semester, junior- to senior-level combinatorics courses. This trusted best-seller covers the key combinatorial ideas--including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The Fifth Edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises.
The number of circular r-permutations of a set of n elements is given by
P(n,r)/r=n!/r(n-r)!
In particular, the number of circular permutations of n elements is (n-1)! (查看原文)
“现在考虑你所喜爱的这个城镇里的居民，在一对相爱的人之间连上一条线，就得到了图的另一个例子。但你要承认这样的事实：有时一个人对另一个人的爱，并不总是能够得到对方的回报”——Richard A. Brualdi，Introdutory Combinatorics（组合数学），机械工业出版社，2005，中译...
(展开)
![[美国] Richard A. Brualdi](https://img2.doubanio.com/view/personage/m/public/d3cef73adeb33d64f4afb32abbf29021.jpg)
limuxia
机械工业出版社2012版（其他版本）
2 有用 壞人 2011-05-31 04:50:04
最好的入門書。無論什麼時候有人找我推薦combinatorics的入門書，我從來就沒有第二個回答。這本書的例子是最精華的部分。不過第五版好像出的有點倉促，typo比較多（好事是中文影印版跟英文幾乎同一時間發布）。
0 有用 [已注销] 2012-01-10 03:20:08
好看~
0 有用 Nova 2010-10-27 21:28:19
挺喜欢的一本数学书～
1 有用 Welfare 2015-03-09 04:58:08
3urequired
1 有用 GeeMusou 2017-11-28 10:28:18
16年9月后就没怎么看，图论部分看不进去。前面的部分非常喜欢。