25,73 €
28,59 €
-10% with code: EXTRA
Combinatorics of Finite Sets
Combinatorics of Finite Sets
25,73
28,59 €
  • We will send in 10–14 business days.
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…
28.59
  • Publisher:
  • ISBN-10: 0486422577
  • ISBN-13: 9780486422572
  • Format: 13.7 x 21.5 x 1.5 cm, minkšti viršeliai
  • Language: English
  • SAVE -10% with code: EXTRA

Combinatorics of Finite Sets (e-book) (used book) | bookbook.eu

Reviews

(3.75 Goodreads rating)

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.

EXTRA 10 % discount with code: EXTRA

25,73
28,59 €
We will send in 10–14 business days.

The promotion ends in 21d.20:57:05

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 0,29 Book Euros!?
  • Author: Ian Anderson
  • Publisher:
  • ISBN-10: 0486422577
  • ISBN-13: 9780486422572
  • Format: 13.7 x 21.5 x 1.5 cm, minkšti viršeliai
  • Language: English English

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.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)