American Mathematical Society, 2008
This is a book version of my blog, covering many (though not all) of my articles in 2007, reworked into a publishable format (and in particular, with formal and updated references).
A draft copy of the book is available here. Note that the formatting for this internet version is significantly different from that in the final print version, in particular the page numbering does not correspond at all.
The official AMS web page for this book is here.
A review of the book for the American Scientist is here.
Here is a review for the MAA.
– Errata –
- Page 51: In Lemma 1.34(2), should be .
- Page 54: The phrase “nonstandard ultrafilter on ” requires some clarification. It should be “ultrafilter on that extends an ultraproduct of nonprincipal ultrafilters on “.
- Page 95, Figure 1: The graph of is missing two edges (namely, the long diagonal edges between opposite corners of the graph).
- Page 101: Footnote 67 is incorrect and should be deleted.
- Page 102: should be .
- Page 128: In the second and third displays, should be .
- Page 129: “decaying faster” should be “decaying faster or having smaller amplitude”.
- Page 143: The proof that is not correct as stated (the perturbations indicated do not preserve the property of being an -flow). A correct argument is as follows. Call an edge of an -flow unsaturated if it has weight strictly between 0 and , and similarly call a vertex unsaturated if its net inflow or outflow is strictly less than . Observe that if e is an unsaturated edge, then the final vertex u of e will either have an unsaturated edge leading out of it (if u is unsaturated) or another unsaturated edge leading into it (if u is saturated). Similarly, the initial vertex u’ of e will either have an unsaturated edge leading into it (if u is unsaturated) or another unsaturated edge leading out of it (if u is saturated). Thus, if there is at least one unsaturated edge, then by iterating the above observations, one can find an oriented cycle along unsaturated edges with the property that at any saturated vertex u, the number of edges flowing along the cycle into u equals the number of edges flowing against the cycle into u, and the number of edges flowing along the cycle out of u equals the number of edges flowing against the cycle out of u. For this cycle, one can modify the flow as indicated in the text to reduce the number of edges in the -flow.
- Page 137: In the last line of Case 1, “multiply (1.47) by…” should be “raise (1.47) to the power and then multiply by…”, and should be .
- Page 148: In the first line, should read .
- Page 180: In the second display, should be .
- Section 2.10: The inequality is only valid for connected graphs with at least one cycle. In general, one only has . One must then delete all terms involving the number 6 in the rest of the section. One can then replace “To solve the optimisation problem exactly, one needs to solve a cubic; but we can perform a much cheaper computation” by “One can solve the optimisation problem exactly, but we can perform a cheaper computation”.
Thanks to Ravindra Bapat, Dion, Tobias and Tony, Norman Hardy, Matthew Kahle, JamesL, Arturo Magadin, Kirane Mokhtar, David P. Moulton, Nikodem Szpak, Sheng-Peng Wu, and Yuncheng for corrections.