Book contents
- Frontmatter
- Contents
- Preface
- 1 Graph decompositions and symmetry
- 2 Combinatorics of optimal designs
- 3 Regularity and the spectra of graphs
- 4 Trades and t-designs
- 5 Extremal graph packing problems: Ore-type versus Dirac-type
- 6 Embedding large subgraphs into dense graphs
- 7 Counting planar graphs and related families of graphs
- 8 Metrics for sparse graphs
- 9 Recent results on chromatic and flow roots of graphs and matroids
Contents
Published online by Cambridge University Press: 05 May 2013
- Frontmatter
- Contents
- Preface
- 1 Graph decompositions and symmetry
- 2 Combinatorics of optimal designs
- 3 Regularity and the spectra of graphs
- 4 Trades and t-designs
- 5 Extremal graph packing problems: Ore-type versus Dirac-type
- 6 Embedding large subgraphs into dense graphs
- 7 Counting planar graphs and related families of graphs
- 8 Metrics for sparse graphs
- 9 Recent results on chromatic and flow roots of graphs and matroids
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781107325975/resource/name/firstPage-9781107325975toc_pv-vi_CBO.jpg)
- Type
- Chapter
- Information
- Surveys in Combinatorics 2009 , pp. v - viPublisher: Cambridge University PressPrint publication year: 2009