【内容简介】
组合数学是研究离散结构和离散对象关系模式的数学分支,是一门在理论和应用上涉及范围很广泛的学科。本书的内容十分丰富,讨论的问题涵盖组合数学所涉及的绝大部分领域,堪称“组合数学的百科全书”。作者的阐述深入浅出,使得高深的内容简明易懂,便于广大读者阅读。本书被美国哥伦比亚大学。斯坦福大学、加州理工学院等许多国外著名大学采纳为教材,在科学技术界读者中也很受推崇。
本书适合作为高年级本科生与低年级研究生的组合数学课程教材,也适合作为数学和其他学科的研究人员的参考书。
【目录信息】
Preface to the first edition
Preface to the second edition
1. Graphs
Terminology of graphs and digraphs, Eulerian cir-
cuits, Hamiltonian circuits
2. Trees
Cayley's theorem, spanning trees and the greedy
algorithm, search trees, strong connectivity
3. Colorings of graphs and Ramsey's theorem
Brooks' theorem, Ramsey's theorem and Ramsey
numbers, the Lovasz sieve, the Erdos-Szekeres
theorem
4. Turan's theorem and extremal graphs
Turan's theorem and extremal graph theory
5. Systems of distinct representatives
Bipartite graphs, P. Hall's condition, SDRs, Konig's
theorem, Birkhoff's theorem
6. Dilworth's theorem and extremal set theory
<< 查看详细目录
【前言】
One of the most popular upper level mathematics courses taught at Caltech for very many years was H. J. Ryser's course Combina-torial Analysis, Math 121. One of Ryser's main goals was to show elegance and simplicity. Furthermore, in this course that he taught so well, he sought to demonstrate coherence of the subject of com-binatorics. We dedicate this book to the memory of Herb Ryser,our friend whom we admired and from whom we learned much.
Work on the present book was started during the academic year 1988-89 when the two authors..
<< 查看前言