Surveys in combinatorics, 2001 /
British Combinatorial Conference (18th : 2001 : University of Sussex)
Surveys in combinatorics, 2001 / edited by J.W.P. Hirschfeld. - Cambridge : Cambridge University Press, 2001. - 1 online resource (ix, 301 pages) : digital, PDF file(s). - London Mathematical Society lecture note series ; 288 . - London Mathematical Society lecture note series ; 288. .
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Crispin Nash-Williams / J. Sheehan -- The Penrose polynomial of graphs and matroids / M. Aigner -- Some cyclic and 1-rotational designs / I. Anderson -- Orthogonal designs and third generation wireless communication / A.R. Calderbank and A.F. Naguib -- Computation in permutation groups : counting and randomly sampling orbits / L.A. Goldberg -- Graph minors and graphs on surfaces / B. Mohar -- Thresholds for colourability and satisfiability in random graphs and boolean formulae / M.S.O. Molloy -- On the interplay between graphs and matroids / J.G. Oxley -- Ovoids, spreads and m-systems of finite classical polar spaces / J.A. Thas -- List colourings of graphs / D.R. Woodall.
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.
9780511721328 (ebook)
Combinatorial analysis--Congresses.
Graph theory--Congresses.
QA164 / .B74 2001
511.6
Surveys in combinatorics, 2001 / edited by J.W.P. Hirschfeld. - Cambridge : Cambridge University Press, 2001. - 1 online resource (ix, 301 pages) : digital, PDF file(s). - London Mathematical Society lecture note series ; 288 . - London Mathematical Society lecture note series ; 288. .
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Crispin Nash-Williams / J. Sheehan -- The Penrose polynomial of graphs and matroids / M. Aigner -- Some cyclic and 1-rotational designs / I. Anderson -- Orthogonal designs and third generation wireless communication / A.R. Calderbank and A.F. Naguib -- Computation in permutation groups : counting and randomly sampling orbits / L.A. Goldberg -- Graph minors and graphs on surfaces / B. Mohar -- Thresholds for colourability and satisfiability in random graphs and boolean formulae / M.S.O. Molloy -- On the interplay between graphs and matroids / J.G. Oxley -- Ovoids, spreads and m-systems of finite classical polar spaces / J.A. Thas -- List colourings of graphs / D.R. Woodall.
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.
9780511721328 (ebook)
Combinatorial analysis--Congresses.
Graph theory--Congresses.
QA164 / .B74 2001
511.6