The 22nd British Combinatorial Conference will be held at the University of St Andrews from the 5th to the 10th of July 2009.
The conference is held every two years and is the major regular European combinatorics conference. It attracts around 200 delegates, these being a mixture of established academics, young researchers, and postgraduates. It provides excellent opportunities for the exchange of ideas and for networking between research groups and individuals. In the past, many successful collaborations have arisen from talks given and contacts made at the BCC. The areas covered are extensive and range from the highly theoretical to very practical issues in aspects such as coding and cryptography.
Latest
- Information for delegates wishing to send us a file containing their talk is available here.
- Information for visitors concerning the recent flu outbreak is available here.
- Due to their limited number, banquet tickets are no longer available. However, a small number of tickets might be available for purchase at the conference.
- The deadline for submission of title and abstract for contributed talks has passed, and we will not be able to accept any further submissions.
- Details of the special issue of Discrete Mathematics devoted to papers presented at the conference are now available here.
- There is the possibility of train travel disruption from Edinburgh to Leuchars on 4th and 5th of July. Click here for more details.
- The early bird discount is no longer available.
- The deadline for applications for postgraduate travel support and LMS Scheme 5 support was 1st of March 2009, and no further applications will be accepted.
Important dates
- 1st of April 2009: the early bird discount cut-off date.
- 1st of June 2009: the deadline for submission of title and abstract for contributed talks.
- 15th of June 2009: the deadline for registering, paying for, and booking accommodation at the conference.
- 7th of July 2009 at 1700 BST: the deadline for submissions to the Special Issue of Discrete Mathematics devoted to the BCC 2009.
Invited talks will be given by:
Arrigo Bonisoli (Università di Modena e Reggio Emilia, Italy):
Graph decompositions and symmetry
Peter J Cameron (Queen Mary, University of London, UK):
Optimal block designs for combinatorialists
Willem H Haemers (Tilburg University, The Netherlands):
Structure and spectra of graphs
Gholamreza B Khosrovshahi (IPM, Iran):
Trades and t-designs
Alexandr V Kostochka (University of Illinois at Urbana-Champaign, USA):
Extremal graph packing problems: Ore-type versus Dirac-type
Daniela Kühn (University of Birmingham, UK):
Embedding large graphs into dense graphs
Marc Noy (Universitat Politècnica de Catalunya, Spain):
Counting planar graphs and related families of graphs
Oliver Riordan (University of Oxford, UK):
Inhomogeneous Random Graphs
Gordon Royle (University of Western Australia):
Recent results on the chromatic and flow roots of graphs and binary matroids
The speakers above will each give a 1 hour talk. These talks are intended to be accessible to postgraduate students, postdoctoral fellows, and researchers in all areas of combinatorics. In addition, participants are invited to give a talk of 20 minutes on any combinatorial topic. A problem session will be held on the last day.
Organisers: Sophie Huczynska (Local Organiser), James Mitchell and Colva Roney-Dougal