Book contents
- Frontmatter
- Contents
- Preface
- 1 Hereditary and monotone properties of combinatorial structures
- 2 Ordering classes of matrices of 0's and 1's
- 3 Cycle decompositions of complete graphs
- 4 Excluding induced subgraphs
- 5 Designs and topology
- 6 The number of points on an algebraic curve over a finite field
- 7 On the efficient approximability of constraint satisfaction problems
- 8 The combinatorics of cryptographic key establishment
- 9 Bandwidth of graphic matroids
5 - Designs and topology
Published online by Cambridge University Press: 16 March 2010
Book contents
- Frontmatter
- Contents
- Preface
- 1 Hereditary and monotone properties of combinatorial structures
- 2 Ordering classes of matrices of 0's and 1's
- 3 Cycle decompositions of complete graphs
- 4 Excluding induced subgraphs
- 5 Designs and topology
- 6 The number of points on an algebraic curve over a finite field
- 7 On the efficient approximability of constraint satisfaction problems
- 8 The combinatorics of cryptographic key establishment
- 9 Bandwidth of graphic matroids
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 2007 , pp. 121 - 174Publisher: Cambridge University PressPrint publication year: 2007
- 10
- Cited by