Combinatorics of Finite Sets - Rilegato

Anderson, Ian

Rilegato

ISBN 10: 0198533675 ISBN 13: 9780198533672

Casa editrice: Oxford Univ Pr, 1987

Riassunto

The combinatorial study of finite set systems is a lively area of research unified by the gradual discovery of structural insights and widely applicable proof techniques. This book is the first coherent and up-to-date account of the basic methods and results of this study. Much of the material in the book concerns subsets of a set, but chapters also cover more general partially ordered sets. For example, the Clements-Lindstrom extension of the Kruskal-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. The work is important for postgraduate students and researchers in discrete mathematics and related subjects.

Su questo libro

Product Description:

Book by Anderson Ian

Su questa edizione

• Editore: Oxford Univ Pr
• Data di pubblicazione: 1987
• ISBN 10: 0198533675
• ISBN 13: 9780198533672
• Rilegatura: Copertina rigida
• Numero di pagine: 266