Surveys in Combinatorics, 1999J. D. Lamb, D. A. Preece The British Combinatorial Conference is one of the most well-known meetings for combinatorialists. This volume collects the invited talks from the 1999 conference held at the University of Kent, and together these span a broad range of combinatorial topics. The nine talks are from: S. Ball, J. Dinitz, M. Dyer, K. Metsch, J. Pach, R. Thomas, C. Thomassen, N. Wormald, plus a special contribution from W. T. Tutte. All researchers into combinatorics will find that this volume is an outstanding and up-to-date resource. |
Contents
II | 4 |
III | 11 |
IV | 13 |
V | 15 |
VI | 17 |
VIII | 18 |
IX | 21 |
X | 23 |
XLII | 146 |
XLIV | 150 |
XLV | 155 |
XLVI | 163 |
XLVII | 167 |
XLVIII | 168 |
XLIX | 170 |
L | 173 |
XI | 25 |
XII | 27 |
XIII | 30 |
XIV | 37 |
XV | 38 |
XVI | 39 |
XVII | 43 |
XVIII | 45 |
XIX | 48 |
XX | 54 |
XXI | 59 |
XXII | 62 |
XXIII | 65 |
XXIV | 68 |
XXV | 72 |
XXVI | 76 |
XXVII | 78 |
XXVIII | 80 |
XXIX | 87 |
XXX | 101 |
XXXI | 102 |
XXXIII | 109 |
XXXIV | 114 |
XXXV | 116 |
XXXVI | 120 |
XXXVII | 128 |
XXXVIII | 137 |
XXXIX | 139 |
XL | 142 |
XLI | 144 |
LI | 176 |
LII | 181 |
LIII | 185 |
LIV | 190 |
LV | 201 |
LVI | 202 |
LVII | 204 |
LVIII | 207 |
LIX | 208 |
LX | 209 |
LXI | 210 |
LXII | 212 |
LXIII | 213 |
LXIV | 214 |
LXV | 215 |
LXVI | 223 |
LXVII | 224 |
LXVIII | 226 |
LXIX | 228 |
LXX | 229 |
LXXI | 231 |
LXXII | 234 |
LXXIII | 239 |
LXXIV | 241 |
LXXV | 265 |
LXXVI | 268 |
LXXVII | 283 |
LXXVIII | 286 |
LXXIX | 287 |
Other editions - View all
Common terms and phrases
4-connected graph algorithm applications asymptotic bipartite graphs blocking set Bollobás codes colour combinatorial designs Combinatorial Theory Computer Science conjecture connected construction contains convex Corollary Cryptography cubic graphs cycle space cyclic d-regular defined degree denote disk arrays distribution elements example exists expected number finite function geometric graph given Gn,d graph G graph theory Hamilton cycles Hamiltonian Hence hyperplane implies independent sets integer isotropic line Journal of Combinatorial least Lemma Let G linear lower bound Markov chain Mathematical Society matroid maximal arcs maximum number method N. C. Wormald networks number of edges obtained orthogonal arrays ovoids P₁ pairing model perfect matching perfect sampling PG(d planar graphs polar space polynomial probability problem projective space proved random graph random regular graphs result s)-nets sampler scheme Section sequence singular points subgraphs subset subspace of dimension totally isotropic line upper bound vertices W. T. Tutte