Printer Friendly

Combinatorics, complexity, and chance; a tribute to Dominic Welsh.


Combinatorics, complexity, and chance; a tribute to Dominic Welsh.

Ed. by Geoffrey Grimmett and Colin McDiarmid.

Oxford U. Press


310 pages




After educating generations of undergraduate and graduate students, Welsh has retired, so to speak, to further pursue his very influential work in discrete mathematics, including theories of graphs, matroids, algorithmic complexity, cryptography, knots, discrete physical models and applied probability. In these 18 essays those he influenced honor him with such lively topics as orbit counting and the Tutte polynomial, Eularian and bipartite orientable matroids, a history and generalizations in Tutte-Whitney polynomials, Markov chains used to randomly sample colorings, a matroid-minor structure theory, graphical applications of Fourier analysis on finite abelian groups, flows and ferromagnets, approximating the Tutte polynomial, non-separating circuits and co-circuits in matroids, expanding the Tutte polynomial of a matroid over the independent sets, connection matrices, complexity of graph polynomials, random planar graphs and the number of planar graphs, advances on the Erdos-Faber-Lovasz conjecture, stochastic set-backs, the unknotting problem, and a review of Welsh's contributions to matroid theory.

([c]20072005 Book News, Inc., Portland, OR)
COPYRIGHT 2007 Book News, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2007 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Publication:SciTech Book News
Article Type:Book Review
Date:Jun 1, 2007
Previous Article:Integrative therapy; a practitioner's guide, 2d ed.
Next Article:The science of real-time data capture; self-reports in health research.

Related Articles
Puzzling Adventures: Tales of Strategy, Logic, and Mathematical Skill.
Combinatorial and computational geometry.
Algebraic and geometric combinatorics; proceedings.
Semigroups and automata; selecta, Uno Kaljulaid (1941-1999).
How Euler did it.
Additive combinatorics; proceedings.
Geometric combinatorics.
Finite fields and applications.

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters |