eBook - PDF
Book details
Table of contents
Citations
About This Book
The British Combinatorial Conference is held every two years and is now a key event for mathematicians worldwide, working in combinatorics. This volume is published on the occasion of the 18th meeting, which was held 1st-6th July 2001 at the University of Sussex. The papers contained here are surveys contributed by the invited speakers, and are thus of a quality befitting the event. There is also a tribute to Crispin Nash-Williams, past chairman of the British Combinatorial Committee. The diversity of the subjects covered means that this will be a valuable reference for researchers in combinatorics. However, graduate students will also find much here that could be of use for stimulating future research.
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoâs features. The only differences are the price and subscription period: With the annual plan youâll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weâve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Surveys in Combinatorics, 2001 by in PDF and/or ePUB format, as well as other popular books in Mathematik & Diskrete Mathematik. We have over one million books available in our catalogue for you to explore.
Information
Topic
MathematikSubtopic
Diskrete MathematikTable of contents
- Cover
- Series Page
- Title
- Copyright
- Dedication
- Contents
- Preface
- Crispin Nash-Williams
- The Penrose polynomial of graphs and matroids
- Some cyclic and I-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