Combinatorics category: 160 books

This book is a useful, attractive introduction to basic counting techniques for upper secondary and junior college students, as well as teachers. Younger students and lay people who appreciate mathematics, not to mention avid puzzle solvers, will also find the book interesting. The various problems...

This book presents state-of-the-art research on the distribution modulo one of sequences of integral powers of real numbers and related topics. Most of the results have never before appeared in one book and many of them were proved only during the last decade. Topics covered include the distribution...

Discrete Mathematics and Applications, Second Edition is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book. Part...

The Rogers--Ramanujan identities are a pair of infinite series—infinite product identities that were first discovered in 1894. Over the past several decades these identities, and identities of similar type, have found applications in number theory, combinatorics, Lie algebra and vertex operator...

This book is intended as a teacher’s manual and as an independent-study handbook for students and mathematical competitors. Based on a traditional teaching philosophy and a non-traditional writing approach (the stair-step method), this book consists of new problems with solutions created by the...

This book, now in a thoroughly revised second edition, provides a comprehensive and accessible introduction to modern set theory. Following an overview of basic notions in combinatorics and first-order logic, the author outlines the main topics of classical set theory in the second part, including...

This book provides a unique and unusual introduction to graph theory by one of the founding fathers, and will be of interest to all researchers in the subject. It is not intended as a comprehensive treatise, but rather as an account of those parts of the theory that have been of special interest to...

Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph...

This text is intended for an honors calculus course or for an introduction to  analysis. Involving rigorous analysis, computational dexterity, and a breadth of  applications, it is ideal for undergraduate majors. This third edition includes  corrections as well as some additional material. Some...

The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject. The papers presented were by invitation only. This volume contains most of the contniutions, suitably refereed and revised. For many...

This book constitutes the thoroughly refereed post-conference proceedings of the 7th International Conference on Trusted Systems, INTRUST 2015, held in Beijing, China, in December 2015. The revised 12 full papers presented have been carefully reviewed and selected from 29 submissions. They...

Combinatorial Algebra: Syntax and Semantics provides comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of  more than 20 fundamental results, both classical and modern. This includes Golod–Shafarevich and Olshanskii's solutions of Burnside problems,...

This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems;...

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This...