Home » Nonfiction » Ian Anderson » Combinatorics of Finite Sets

August 21 , 2007

Combinatorics of Finite Sets


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.

How to download book

Buy this book

You can buy this book now only for $14.39. This is the lowest price for this book.

Buy book

Download book free

If you want to download this book for free, please register, approve your account and get one book for free.


After that you may download book «Combinatorics of Finite Sets»:

Download Adobe DRM:


Download MobiPocket:


Download ePub: