Combinatorics of Finite Sets - Couverture souple

Anderson, Ian

Couverture souple

ISBN 10 : 0198533799 ISBN 13 : 9780198533795

Editeur : Clarendon Press, 1989

Synopsis

It is the aim of this book to provide a coherent and up-to-date account of the basic methods and results of the combinatorial study of finite set systems. From its origins in a 1928 theorem of Sperner, this subject has become a lively area of combinatorial research, unified by the gradual discovery of structural insights and widely applicable proof techniques. Much of the material in the book concerns subsets of a set, but there are chapters dealing with more general partially ordered sets: for example, the Clements-Lindstr on extension of the Kruscal-Katona theorem to multisets is discussed, 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 presented. Each chapter ends with a collection of exercises for which outline solutions are provided, and there is an extensive bibliography.

A propos du livre

Présentation de l'éditeur

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.

Présentation de l'éditeur

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.

Détails de l'édition

• Éditeur: Clarendon Press
• Date d'édition: 1989
• ISBN 10: 0198533799
• ISBN 13: 9780198533795
• Reliure: Broché
• Langue: anglais
• Nombre de pages: 264
• Coordonnées du fabricant: non disponible