Surveys in Combinatorics 1985
Surveys in Combinatorics 1985
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.
$50.00
USDThe 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.
Product details
May 2013Adobe eBook Reader
9781107108004
0 pages
0kg
This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
- Preface
- 1. Combinatorics and Ramanujan's 'lost' notebook G. E. Andrews
- 2. Irregularities of distribution and combinatorics J. Beck
- 3. Adaptive algorithms for communications H. J. Beker
- 4. Random flows: network flows and electrical flows through random media G. R. Grimmett
- 5. On greedy algorithms that succeed A. J. Hoffman
- 6. {0,1*} distance problems in combinatorics J. H. van Lint
- 7. Detachments of graphs and generalised Euler trails C. St J. A. Nash-Williams
- 8. Graph minors - a survey N. Robertson and P. D. Seymour
- Index of names.
