Surveys in Combinatorics 1985: Invited Papers

The British Combinatorial Conference is an established biennial international gathering. This volume contains the invited papers presented, by several distinguished mathematicians, at the 1985 conference. The papers cover a broad range of combinatorial topics, including cryptography, greedy algorithms, graph minors, flows through random networks, (0, 1)-distance problems, irregularities of point distributions and reconstruction of infinite graphs.

Preface
Combinatorics and Ramanujan's 'lost' notebook
Irregularities of distribution and combinatorics
Adaptive algorithms for communications
Random flows: network flows and electrical flows through random media
On greedy algorithms that succeed
{0,1*} distance problems in combinatorics
Detachments of graphs and generalised Euler trails
Graph minors - a survey
Index of names
Table of Contents provided by Publisher. All Rights Reserved.

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Surveys in Combinatorics 1985: Invited Papers for the Tenth British Combinatorial Conference

Summary

Table of Contents

Supplemental Materials