组合数学

Richard A．Brualdi美国威斯康星大学麦迪逊分校数学系教授（现已退休），曾任该系主任多年。他的研究方向包括组合数学、图论、线性代数和矩阵理论．编码理论等。Brualdi教授的学术活动非常丰富，担任过多种学术期刊的主编。2000年由于“在组合数学研究中所做出的杰出终身成就”而获得组合数学及其应用学会颁发的欧拉奖章。

《组合数学(英文版)(第5版)》英文影印版由Pearson Education Asia Ltd．授权机械工业出版社独家出版。未经出版者书面许可，不得以任何方式复制或抄袭奉巾内容。仅限于中华人民共和国境内(不包括中国香港、澳门特别行政区和中同台湾地区)销售发行。《组合数学(英文版)(第5版)》封面贴有Pearson Education(培生教育出版集团)激光防伪标签，无标签者不得销售。English reprint edition copyright@2009 by Pearson Education Asia Limited and China Machine Press． Original English language title：Introductory Combinatorics，Fifth Edition(ISBN978—0—1 3-602040-0)by Richard A．Brualdi，Copyright@2010，2004，1999，1992，1977 by Pearson Education，lnc． All rights reserved． Published by arrangement with the original publisher，Pearson Education，Inc．publishing as Prentice Hall． For sale and distribution in the People’S Republic of China exclusively(except Taiwan，Hung Kong SAR and Macau SAR)．

Preface1 What Is Combinatorics? 1.1 Example: Perfect Covers of Chessboards 1.2 Example: Magic Squares 1.3 Example: The Four-Color Problem 1.4 Example: The Problem of the 36 OfFicers 1.5 Example: Shortest-Route Problem 1.6 Example: Mutually Overlapping Circles 1.7 Example: The Game of Nim 1.8 Exercises2 Permutations and Combinations 2.1 Four Basic Counting Principles 2.2 Permutations of Sets 2.3 Combinations (Subsets) of Sets 2.4 Permutations of Multisets 2.5 Combinations of Multisets 2.6 Finite Probability 2.7 Exercises3 The Pigeonhole Principle 3.1 Pigeonhole Principle: Simple Form 3.2 Pigeonhole Principle: Strong Form 3.3 A Theorem of Ramsey 3.4 Exercises4 Generating Permutations and Combinations 4.1 Generating Permutations 4.2 Inversions in Permutations 4.3 Generating Combinations 4.4 Generating r-Subsets 4.5 Partial Orders and Equivalence Relations 4.6 Exercises5 The Binomial Coefficients 5.1 Pascal's Triangle 5.2 The Binomial Theorem 5.3 Unimodality of Binomial Coefficients 5.4 The Multinomial Theorem 5.5 Newton's Binomial Theorem 5.6 More on Partially Ordered Sets 5.7 Exercises6 The Inclusion-Exclusion Principle and Applications 6.1 The Inclusion-Exclusion Principle 6.2 Combinations with Repetition 6.3 Derangements 6.4 Permutations with Forbidden Positions 6.5 Another Forbidden Position Problem 6.6 M6bius Inversion 6.7 Exercises7 Recurrence Relations and Generating Functions 7.1 Some Number Sequences 7.2 Generating Functions 7.3 Exponential Generating Functions 7.4 Solving Linear Homogeneous Recurrence Relations 7.5 Nonhomogeneous Recurrence Relations 7.6 A Geometry Example 7.7 Exercises8 Special Counting Sequences 8.1 Catalan Numbers 8.2 Difference Sequences and Stirling Numbers 8.3 Partition Numbers 8.4 A Geometric Problem 8.5 Lattice Paths and Schr6der Numbers 8.6 Exercises9 Systems of Distinct Representatives 9.1 General Problem Formulation 9.2 Existence of SDRs 9.3 Stable Marriages 9.4 Exercises10 Combinatorial .Designs 10.1 Modular Arithmetic 10.2 Block Designs 10.3 Steiner Triple Systems 10.4 Latin Squares 10.5 Exercises11 Introduction to Graph Theory 11.1 Basic Properties 11.2 Eulerian Trails 11.3 Hamilton Paths and Cycles 11.4 Bipartite Multigraphs 11.5 Trees 11.6 The Shannon Switching Game 11.7 More on Trees 11.8 Exercises12 More on Graph Theory 12.1 Chromat,ic Number 12.2 Plane and Planar Graphs 12.3 A Five-Color Theorem 12.4 Independence Number and Clique Number 12.5 Matching Number 12.6 Connectivity 12.7 Exercises13 Digraphs and Networks 13.1 Digraphs 13.2 Networks 13.3 Matchings in Bipartite Graphs Revisited 13.4 Exercises14 Polya Counting 14.1 Permutation and Symmetry Groups 14.2 Burnside's Theorem 14.3 Polya's Counting Formula 14.4 ExercisesAnswers and Hints to ExercisesBibliographyIndex