Updated On December 30th, 2025
top10.desc
| Rank | Product Name | Score | |
|---|---|---|---|
| 1 |
|
Dover Books on Mathematics: Combinatorics of Finite Sets (Paperback)
Check Price
|
0%
|
| 2 |
|
Dover Books on Mathematics: Matroid Theory (Paperback)
Check Price
|
0%
|
| 3 |
|
A Book of Set Theory (Paperback)
Check Price
|
0%
|
Our Score
Among other subjects explored are the Clements-Lindström extension of the Kruskal-Katona theorem to multisets and the Greene-Kleitmen result concerning k-saturated chain partitions of general partially ordered sets. Includes exercises and solutions.
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.
Our Score
Text by a noted expert describes standard examples and investigation results, using elementary proofs to develop basic matroid properties before advancing to a more sophisticated treatment. Includes numerous exercises. 1976 edition.
The theory of matroids connects disparate branches of combinatorial theory and algebra such as graph and lattice theory, combinatorial optimization, and linear algebra. Aimed at advanced undergraduate and graduate students, this text is one of the earliest substantial works on matroid theory. Its author, D. J. A. Welsh, Professor of Mathematics at Oxford University, has exercised a profound influence over the theory's development. The first half of the text describes standard examples and investigation results, using elementary proofs to develop basic matroid properties and referring readers to the literature for more complex proofs. The second half advances to a more sophisticated treatment, addressing a variety of research topics. Praised by the Bulletin of the American Mathematical Society as "a useful resource for both the novice and the expert," this text features numerous helpful exercises.
Our Score
Accessible approach to set theory for upper-level undergraduates poses rigorous but simple arguments. Topics include classes and sets, functions, natural and cardinal numbers, arithmetic of ordinal numbers, and more. 1971 edition with new material by author.
Suitable for upper-level undergraduates, this accessible approach to set theory poses rigorous but simple arguments. Each definition is accompanied by commentary that motivates and explains new concepts. Starting with a repetition of the familiar arguments of elementary set theory, the level of abstract thinking gradually rises for a progressive increase in complexity. A historical introduction presents a brief account of the growth of set theory, with special emphasis on problems that led to the development of the various systems of axiomatic set theory. Subsequent chapters explore classes and sets, functions, relations, partially ordered classes, and the axiom of choice. Other subjects include natural and cardinal numbers, finite and infinite sets, the arithmetic of ordinal numbers, transfinite recursion, and selected topics in the theory of ordinals and cardinals. This updated edition features new material by author Charles C. Pinter.