Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Online ordering will be unavailable from Sunday, October 5 at 08:00 GMT until 18:00 GMT .

To place an order, please contact Customer Services.

UK/ROW directcs@cambridge.org +44 (0) 1223 326050 | US customer_service@cambridge.org 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand enquiries@cambridge.edu.au 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Recommended product

Popular links

Popular links


Surveys in Combinatorics, 1995

Surveys in Combinatorics, 1995

Surveys in Combinatorics, 1995

Editor:
Peter Rowlinson, University of Stirling
C. Godsil, R. Hill, F. Jaeger, M. Jerrum, L. Lovasz, A. Lubotzky, A. Rosa, E. Spence, J. Spencer
Published:
July 1995
Availability:
Available
Format:
Paperback
ISBN:
9780521497978

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

$50.00
(C) USD
Paperback
$50.00 (Z) USD
eBook

    This volume provides an up-to-date survey of current research activity in several areas of combinatorics and its applications. These include distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation. The articles give an overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.

    • Combinatorics always sells well
    • Good names
    • Aimed at researchers in mathematics and computer science

    Product details

    July 1995
    Paperback
    9780521497978
    240 pages
    227 × 153 × 14 mm
    0.351kg
    Available

    Table of Contents

    • 1. The Euclidean geometry of distance regular graphs: C. Godsil
    • 2. Searching with lies: R. Hill
    • 3. Spin models for link invariants: F. Jaeger
    • 4. Computational Polya theory: M. Jerrum
    • 5. Exact and approximate mixing of random walks: L. Lovasz
    • 6. Cayley graphs: eigenvalues, expanders and random walks: A. Lubotzky
    • 7. Large sets of Steiner triple systems: A. Rosa
    • 8. Construction and classification of combinatorial designs: E. Spence
    • 9. Modern probabilistic methods in combinatorics: J. Spencer.
      Contributors
    • C. Godsil, R. Hill, F. Jaeger, M. Jerrum, L. Lovasz, A. Lubotzky, A. Rosa, E. Spence, J. Spencer

    • Editor
    • Peter Rowlinson , University of Stirling