Combinatorics of Finite Sets

Front Cover
Courier Corporation, 1987 - Mathematics - 250 pages
1 Review
Coherent treatment provides comprehensive view of basic methods and results of the combinatorial study of finite set systems. The Clements-Lindstrom extension of the Kruskal-Katona theorem to multisets is explored, as is the Greene-Kleitman result concerning k-saturated chain partitions of general partially ordered sets. Connections with Dilworth's theorem, the marriage problem, and probability are also discussed. Each chapter ends with a helpful series of exercises and outline solutions appear at the end. "An excellent text for a topics course in discrete mathematics." — Bulletin of the American Mathematical Society.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

I
1
II
10
III
27
IV
56
V
70
VI
87
VII
112
VIII
131
IX
145
X
162
XI
176
XII
187
XIII
201
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information