โ Scribed by Ian Anderson (eds.)
No coin nor oath required. For personal study only.
Format Paperback Subject Computer Science Combinatorics Publisher Cambridge University Press
Content: 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.
Combinatorial analysis -- Congresses;Combinatorial analysis
๐ SIMILAR VOLUMES
Book by
From rather modest beginnings, the British Combinatorial Conference grew into an established biennial international gathering. A successful format for the series of conferences was established, whereby several distinguished mathematicians were invited to give a survey lecture and to write a paper fo
Many areas of current research activity in combinatorics and its applications, including graph theory, designs and probabilistic graphs, are surveyed in lectures presented at the 12th British Combinatorial Conference.
<span>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 al