Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Product Description
Book by Anderson Ian
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Combinatorics of Finite Sets
Foto dell'editore
Combinatorics of Finite Sets
Editore:
Oxford University Press, Incorporated, 1987
ISBN 10: 0198533675
ISBN 13: 9780198533672
Antico o usato
Rilegato
Da: Better World Books, Mishawaka, IN, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Fine. Used book that is in almost brand-new condition. Codice articolo 52114983-6
Compra usato
EUR 28,36
Spese di spedizione:
GRATIS
In U.S.A.
Quantità: 1 disponibili