{"product_id":"combinatorics-of-finite-sets-paperback","title":"Combinatorics of Finite Sets - Paperback","description":"\u003cdiv\u003e\u003cp style=\"text-align: right;\"\u003e\u003ca href=\"https:\/\/reportcopyrightinfringement.com\/\" target=\"_blank\" rel=\"nofollow\"\u003e\u003cb\u003eReport copyright infringement\u003c\/b\u003e\u003c\/a\u003e\u003c\/p\u003e\u003c\/div\u003e\u003cp\u003eby \u003cb\u003eIan Anderson\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003eCoherent 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 \u003ci\u003ek\u003c\/i\u003e-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. -- \u003ci\u003eBulletin of the American Mathematical Society.\u003c\/i\u003e\u003c\/p\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 272\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.57 x 8.46 x 5.38 IN\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e November 02, 2011\u003c\/div\u003e\n            ","brand":"BooksCloud","offers":[{"title":"Default Title","offer_id":45055546818662,"sku":"9780486422572","price":29.41,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0599\/7255\/0758\/files\/VmZOMGtiYzB0Y3VGWWhDQWl6U0Q1dz09.webp?v=1773247841","url":"https:\/\/infinitylightwa.com\/products\/combinatorics-of-finite-sets-paperback","provider":"Infinity Light","version":"1.0","type":"link"}