Combinatorics of finite sets
β Anderson I.
π Library
π
2002
π Dover
π English
β¦ LIBER β¦
π
Combinatorics of Finite Sets
β Scribed by Ian Anderson
- Publisher
- Dover Publications Inc.
- Year
- 2002
- Tongue
- English
- Leaves
- 267
- Series
- Dover Books on Mathematics
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
β¦ Subjects
ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;ΠΠΈΡΠΊΡΠ΅ΡΠ½Π°Ρ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;ΠΠΎΠΌΠ±ΠΈΠ½Π°ΡΠΎΡΠΈΠΊΠ°;
π SIMILAR VOLUMES
Combinatorics of finite sets
β Ian Anderson, Ph. D
π Library
π
1987
π Clarendon Press
π English
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
Combinatorics of finite sets
β Hunter Saint Clair Snevily
π Library
π
1991
π English
Hypergraphs: combinatorics of finite set
β C. Berge
π Library
π
1989
π North Holland
π English
Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinator
Hypergraphs: combinatorics of finite set
β C. Berge
π Library
π
1989
π Elsevier, Academic Press
π English
Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinator
Hypergraphs: combinatorics of finite set
β C. Berge
π Library
π
1989
π North Holland
π English