02519nam a22003258i 4500001001600000003000700016008004100023020001800064020001800082035002000100041000800120082001400128245007700142264007100219300003800290336002600328337002600354338003600380490005900416500001300475505068600488520071701174650004001891650003001931700003401961856005501995932003202050596000602082949010502088CR9780511721328UkCbUP100303s2001||||enk o ||1 0|eng|d a9780511721328 a9780521002707 a(Sirsi) a793438 aeng04a511.622110aSurveys in combinatorics, 2001h[E-Book] /cedited by J.W.P. Hirschfeld. 1aCambridge :bCambridge University Press,c2001e(CUP)fCUP20200108 a1 online resource (ix, 301 pages) atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier aLondon Mathematical Society lecture note series ;v288 aenglisch0 aCrispin 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. aThe 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. 0aCombinatorial analysisvCongresses. 0aGraph theoryvCongresses.1 aHirschfeld, J. W. P.,eeditor40uhttps://doi.org/10.1017/CBO9780511721328zVolltext aCambridgeCore (Order 30059) a1 aXX(793438.1)wAUTOc1i793438-1001lELECTRONICmZBrNsYtE-BOOKu8/1/2020xUNKNOWNzUNKNOWN1ONLINE