Graph Theory (on Demand Printing Of 02787)

If you are looking for examples of computer algorithms, look elsewhere; the closest this will get you is to "existence proofs", which is showing that something (such as a hamiltonian cycle) exists in a graph that has thus-and-such number of points or edges, but not tell you which sequence of points/edges make up that something. (For example, a graph can be embedded in a plane unless there's a subgraph that looks like K(5) or K(3,3) inside it - this is in about chapter 5, and an important theorem. The text proves this, but doesn't tell you HOW to embed the graph in a plane.)

That said, this is an excellent book for theoretical mathematics. I understand that the first two chapters can be used as a high school math text, as an introduction to proofs, and agree that it would work well.

As a formal introduction to proving theorems, especially in a self-contained world (you don't need many prerequisites for this, like you do for a topology or analysis text), this is pretty swell.

So, to the person who said that he didn't like this because there weren't algorithms in the book: you can find those in the semiliterate computer science textbooks. (I would insist that the last four words of the previous sentence are redundant.)

Look here for mathematics.


Exellent Introduction   August 8, 2000
Marete (Chicago, IL USA)
16 out of 17 found this review helpful

Almost no pre-requisites are needed for this book, (There is a short section which touches on Linear Alg, and another on very elementary topology) and yet it will take you from the very basic notions, to research level problems in this subject. It covers almost all the major notions about graphs, including coloring, matching, flows... Any reader is bound to find the section on Ramsey theory especially interesting. However, infinite graphs and Algebric graph theory are not covered.

There is a useful commentary on the references at the end of each chapter.