Book contents
- Frontmatter
- Contents
- Preface
- Euclidean geometry of distance regular graphs
- Large sets of Steiner triples
- Searching with lies
- Spin models for link invariants
- Computational Pólya theory
- Mixing of random walks and other diffusions on a graph
- Cayley graphs: eigenvalues, expanders and random walks
- Construction and classification of combinatorial designs
- Modern probabilistic methods in combinatorics
Contents
Published online by Cambridge University Press: 05 May 2010
Edited by
Book contents
- Frontmatter
- Contents
- Preface
- Euclidean geometry of distance regular graphs
- Large sets of Steiner triples
- Searching with lies
- Spin models for link invariants
- Computational Pólya theory
- Mixing of random walks and other diffusions on a graph
- Cayley graphs: eigenvalues, expanders and random walks
- Construction and classification of combinatorial designs
- Modern probabilistic methods in combinatorics
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Surveys in Combinatorics, 1995 , pp. v - viPublisher: Cambridge University PressPrint publication year: 1995