Combinatorics of Finite Sets

Combinatorics of Finite Sets

By: Ian Anderson

  • eBook
  • Sale Price › $12.79
  • Share this book:
  • Share on Google+

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.

Reprint of the Oxford University Press, Oxford, U.K. and New York, 1989 edition.
AvailabilityOut of Stock
ISBN 100486422577
ISBN 139780486422572
Author/EditorIan Anderson
Page Count272
Dimensions5 1/2 x 8 1/2

You might also Like...

Out of Stock Notification: