✨ New Arrivals Just Dropped!Explore
HomeStore

Combinatorics of Finite Sets

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.

Reprint of the Oxford University Press, Oxford, U.K. and New York, 1989 edition.
advanced mathematics; applied science and math; geometric probability; discrete mathematics; combinatorial study; binomial coefficients; college level studies; advanced undergraduate; graduate level; clements lindstrom; kruskal katona theorem; multisets; greene kleitman; k saturated chain partitions; general partially ordered sets; dilworth theorem; the marriage problem; probability; exercises and solutions; Finite Sets; Combinatorics of finite sets; Discrete mathematics; Symmetric chains; Antichains in mathematics
$5.60

Original: $15.99

-65%
Combinatorics of Finite Sets

$15.99

$5.60
Product image 1

Description

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.
advanced mathematics; applied science and math; geometric probability; discrete mathematics; combinatorial study; binomial coefficients; college level studies; advanced undergraduate; graduate level; clements lindstrom; kruskal katona theorem; multisets; greene kleitman; k saturated chain partitions; general partially ordered sets; dilworth theorem; the marriage problem; probability; exercises and solutions; Finite Sets; Combinatorics of finite sets; Discrete mathematics; Symmetric chains; Antichains in mathematics