Ronald L. Graham

Donald Ervin Knuth

Oren Patashnik

This book, updated and improved, introduces the mathematics that support advanced computer programming and the analysis of algorithms. The book's primary aim is to provide a solid and relevant base of mathematical skills. It is an indispensable text and reference for computer scientists and serious programmers in virtually every discipline.

A Foundation for Computer Science

Concrete Mathematics

Concrete Mathematics: A Foundation for Computer Science

Persi Diaconis

Ron Graham

Magical Mathematics reveals the secrets of fun-to-perform card tricks—and the profound mathematical ideas behind them—that will astound even the most accomplished magician. Persi Diaconis and Ron Graham provide easy, step-by-step instructions for each trick, explaining how to set up the effect and offering tips on what to say and do while performing it. Each card trick introduces a new mathematical idea, and varying the tricks in turn takes readers to the very threshold of today’s mathematical knowledge. Diaconis and Graham tell the stories—and reveal the best tricks—of the eccentric and brilliant inventors of mathematical magic. The book exposes old gambling secrets through the mathematics of shuffling cards, explains the classic street-gambling scam of three-card Monte, traces the history of mathematical magic back to the oldest mathematical trick—and much more.

The Mathematical Ideas that Animate Great Magic Tricks

Magical Mathematics

Конкретная математика. Основание информатики

Martin Grötschel

László Lovász

Laszlo Lovasz

Laszla3

L?szl?

Basic Graph Theory: Paths and Circuits J. A. Bondy2.

Handbook of Combinatorics

Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics. The selection first elaborates on the basic graph theory, connectivity and network flows, and matchings and extensions. Discussions focus on stable sets and claw free graphs, nonbipartite matching, multicommodity flows and disjoint paths, minimum cost circulations and flows, special proof techniques for paths and circuits, and Hamilton paths and circuits in digraphs. The manuscript then examines coloring, stable sets, and perfect graphs and embeddings and minors. The book takes a look at random graphs, hypergraphs, partially ordered sets, and matroids. Topics include geometric lattices, structural properties, linear extensions and correlation, dimension and posets of bounded degree, hypergraphs and set systems, stability, transversals, and matchings, and phase transition. The manuscript also reviews the combinatorial number theory, point lattices, convex polytopes and related complexes, and extremal problems in combinatorial geometry. The selection is a valuable reference for researchers interested in combinatorics.

Handbook of Combinatorics Volume 1

Jaroslav Nesetril

In 1992, when Paul Erdos was awarded a Doctor Honoris Causa by Charles University in Prague, a small conference was held, bringing together a distin guished group of researchers with interests spanning a variety of fields related to Erdos' own work. At that gathering, the idea occurred to several of us that it might be quite appropriate at this point in Erdos' career to solicit a col lection of articles illustrating various aspects of Erdos' mathematical life and work. The response to our solicitation was immediate and overwhelming, and these volumes are the result. Regarding the organization, we found it convenient to arrange the papers into six chapters, each mirroring Erdos' holistic approach to mathematics. Our goal was not merely a (random) collection of papers but rather a thor oughly edited volume composed in large part by articles explicitly solicited to illustrate interesting aspects of Erdos and his life and work. Each chap ter includes an introduction which often presents a sample of related Erdos' problems "in his own words". All these (sometimes lengthy) introductions were written jointly by editors. We wish to thank the nearly 70 contributors for their outstanding efforts (and their patience). In particular, we are grateful to Bela Bollobas for his extensive documentation of Paul Erdos' early years and mathematical high points (in the first part of this volume); our other authors are acknowledged in their respective chapters. We also want to thank A. Bondy, G. Hahn, I.

The Mathematics of Paul Erdös II

Discrete mathematics stands among the leading disciplines of mathematics and theoretical computer science. This is due primarily to its increasing role in university curriculae and its growing importance in applications ranging from optimization to molecular biology. An inaugural conference was held cooperatively by DIMATIA and DIMACS to focus on the versatility, width, and depth of current progress in the subject area. This volume offers a well-balanced blend of research and survey papers reflecting the exciting, attractive topics in contemporary discrete mathematics. Discussed in the book are topics such as graph theory, partially ordered sets, geometrical Ramsey theory, computational complexity issues and applications.

Ronald L. Graham

Books

Your next favorite book is out there