scientific article; zbMATH DE number 3912382

From MaRDI portal
Publication:3689189





The contents of discrete mathematics is not well defined although this branch of mathematics existing in it during all the human culture now disposes of two special journals. No summary-up-to-date-monographs or textbooks appeared. At least from this reason the appearance of Biggs' book is welcome. The titles of the chapters: Part I (Numbers and counting): 1) Integers. 2) Functions and counting. 3) Principles of counting. 4) Subsets and designs. 5) Partition, classification, and distribution. 6) Modular arithmetic. Part II (Graphs and algorithms): 7) Algorithms and their efficiency. 8) Graphs. 9) Trees, sorting, and searching. 10) Bipartite graphs and matching problems. 11) Digraphs, networks, and flows. 12) Recursive techniques. Part III (Algebraic methods): 13) Groups. 14) Groups of permutations. 15) Rings, fields, and polynomials. 16) Finite fields and some applications. 17) Error- correcting codes. 18) Generating functions. 19) Partitions of a positive integer. 20) Symmetry and counting. The book is addressed to a wide range of users interested in mathematics, mainly to students. The presentation is effectual: A good choice of the material, a clear style, not too difficult proofs, a nice typographical form. For the reader a large number of exercises of various level is a great benefit. It would be useful to include in the following editions of the book a selection of titles of books and survey papers at the ends of the parts or chapters.












This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689189)