Gå direkte til innholdet
Combinatorics of Finite Sets
Combinatorics of Finite Sets
Spar

Combinatorics of Finite Sets

Forfatter:
Engelsk
Les i Adobe DRM-kompatibelt e-bokleserDenne e-boka er kopibeskyttet med Adobe DRM som påvirker hvor du kan lese den. Les mer
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. "e;An excellent text for a topics course in discrete mathematics."e; — Bulletin of the American Mathematical Society.
Forfatter
Ian Anderson
ISBN
9780486143712
Språk
Engelsk
Utgivelsesdato
30.4.2012
Tilgjengelige elektroniske format
  • Epub - Adobe DRM
Les e-boka her
  • E-bokleser i mobil/nettbrett
  • Lesebrett
  • Datamaskin