Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Crispin Nash-Williams
- The Penrose polynomial of graphs and matroids
- Some cyclic and 1-rotational designs
- Orthogonal designs and third generation wireless communication
- Computation in permutation groups: counting and randomly sampling orbits
- Graph minors and graphs on surfaces
- Thresholds for colourability and satisfiability in random graphs and boolean formulae
- On the interplay between graphs and matroids
- Ovoids, spreads and m-systems of finite classical polar spaces
- List colourings of graphs
Thresholds for colourability and satisfiability in random graphs and boolean formulae
Published online by Cambridge University Press: 05 August 2013
Edited by
Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Crispin Nash-Williams
- The Penrose polynomial of graphs and matroids
- Some cyclic and 1-rotational designs
- Orthogonal designs and third generation wireless communication
- Computation in permutation groups: counting and randomly sampling orbits
- Graph minors and graphs on surfaces
- Thresholds for colourability and satisfiability in random graphs and boolean formulae
- On the interplay between graphs and matroids
- Ovoids, spreads and m-systems of finite classical polar spaces
- List colourings of graphs
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, 2001 , pp. 165 - 198Publisher: Cambridge University PressPrint publication year: 2001
- 1
- Cited by