相关商品推荐
·赢在用户
·CSS网站布局实录第2版
·搜索引擎营销
·Java编程思想(第4版
·CSS禅意花园
·XML HACKS 10
·JAVA JDK6学习笔
·Java编程思想(英文版
·Ajax模式与最佳实践
·Excel实战技巧精粹(
特价促销商品
您最近的浏览历史
暂无浏览历史组合数学(英文版.第3版)(Introductory Combinatorics (Third Edition) )
出 版 社:
机械工业出版社
- 出版时间:2002-1-1
- ISBN:7111091582
- 页数:614
- 销售状态:在销
定价:¥35.00
时代网价:¥29.75 折扣:85折 节省:¥5.25
配送区域:成都市区免费送货上门、货到付款;四川其它地区送货上门、货到付款。全国范围内使用支付宝支付,先收货,后付款,安全方便(支付宝信任商家)。查看具体配送区域
关注过此商品的顾客还关注过
内容简介
This third edition of Introductory Combinatorics contains extensive rewriting of some sections and the inclusion of some new material and exercises. There is enough material in this third edition for a two-semester course. A first semester could have an emphasis on counting and a second semester an emphasis on graph theory. It is difficult to assess the prerequisites for this book. Perhaps they can be best described as the mathematical maturity achieved by the successful completion of the calculus sequence and an elementary course on linear algebra. Use of calculus is minimal, and the references to linear algebra are few and should not cause any problem to those not familiar with it.
作者介绍
目录介绍
Preface
Chapter 1 What is Combinatorics?
Chapter 2 The Pigeonhole Principle
Chapter 3 Permutations and Combinations
Chapter 4 Generating Permutations and Combinations
Chapter 5 The Binomial Coefficients
Chapter 6 The Inclusion-Exclusion Principle and Applications
Chapter 7 Recurrence Relations and Generating Functions
Chapter 8 Special Counting Sequences
Chapter 9 Matchings in Bipartite Graphs
Chapter 10 Combinatorial Designs
Chapter 11 Introduction to Graph Theory
Chapter 12 Digraphs and Networks
Chapter 13 More on Graph Theory
Chapter 14 Polya Counting
Answers and Hints to Exercises
Bibliography
Index 【媒体评论】
Chapter 1 What is Combinatorics?
Chapter 2 The Pigeonhole Principle
Chapter 3 Permutations and Combinations
Chapter 4 Generating Permutations and Combinations
Chapter 5 The Binomial Coefficients
Chapter 6 The Inclusion-Exclusion Principle and Applications
Chapter 7 Recurrence Relations and Generating Functions
Chapter 8 Special Counting Sequences
Chapter 9 Matchings in Bipartite Graphs
Chapter 10 Combinatorial Designs
Chapter 11 Introduction to Graph Theory
Chapter 12 Digraphs and Networks
Chapter 13 More on Graph Theory
Chapter 14 Polya Counting
Answers and Hints to Exercises
Bibliography
Index 【媒体评论】
顾客评论
(查看所有有关此商品的评论)
(查看所有有关此商品的评论)商品问答
(查看所有问答)















