This book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. The book covers those parts of enumerative combinatorics of greatest applicability to other areas of mathematics. The four chapters are devoted to an introduction to enumeration (suitable for advanced undergraduates), sieve methods (including the Principle of Inclusion-Exclusion), partially ordered sets, and rational generating functions. There are a large number of exercises, almost all with solutions, which greatly augment the text and provide entry into many areas not covered directly. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.

《组合代数拓扑(影印版)》内容简介：Combinatorial algebraic topology is a fascinating and dynamic field at the crossroads of algebraic topology and discrete mathematics. This volume is the first comprehensive treatment of the subject in book form. The first part of the book constitutes a swft walk through the main tools of algebraic topology，including Stiefel-Whitney characteristic classes，which are needed for the later. parts. Readers-graduate students and working mathematicians alike-will probably find particularly useful the second part，which contains an in-depth discussion of the major research techniques of combinatorial algebraic topology. Our presentation of standard topics is quite different from that of existing texts. In addition， several new themes，such as spectral sequences，are included. Although applications are sprinkled throughout the second part，they are principal focus of the third part，which is entirely devoted to developing the topological structure theory for graph homomorphisms. The main benefit for the reader will be the prospect of fairly quickly getting to the forefront of modem research in this active field.

图论在计算科学、社会科学和自然科学等各个领域都有广泛应用。本书是本科生或研究生一学期或两学期的图论课程教材。全书力求保持按证明的难度和算法的复杂性循序渐进的风格，使学生能够深入理解书中的内容。书中包括对证明技巧的讨论、1200多道习题、400多幅插图以及许多例题，而且对所有定理都给出了详细完整的证明。虽然本书包括许多算法和应用，但是重点在于理解图论结构和分析图论问题的技巧。