
Surveys in Combinatorics 2019
Cambridge University Press
Published on 27. June 2019
Book
Paperback/Softback
272 pages
978-1-108-74072-2 (ISBN)
Description
This volume contains eight survey articles based on the invited lectures given at the 27th British Combinatorial Conference, held at the University of Birmingham in July 2019. This biennial conference is a well-established international event, with speakers from around the world. The volume provides an up-to-date overview of current research in several areas of combinatorics, including graph theory, cryptography, matroids, incidence geometries and graph limits. Each article is clearly written and assumes little prior knowledge on the part of the reader. The authors are some of the world's foremost researchers in their fields, and here they summarise existing results and give a unique preview of cutting-edge developments. The book provides a valuable survey of the present state of knowledge in combinatorics, and will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Product notice
Paperback (trade)
Illustrations
Worked examples or Exercises; 27 Halftones, black and white; 40 Line drawings, black and white
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 15 mm
Weight
402 gr
ISBN-13
978-1-108-74072-2 (9781108740722)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Allan Lo | Richard Mycroft | Guillem Perarnau
Surveys in Combinatorics 2019
E-Book
06/2019
Cambridge University Press
€60.49
Available for download
Persons
Editor
University of Birmingham
University of Birmingham
Universitat Politecnica de Catalunya, Barcelona
University of Birmingham
Content
1. Clique-width for hereditary graph classes Konrad K. Dabrowski, Matthew Johnson and Dani?l Paulusma; 2. Analytic representations of large graphs Andrzej Grzesik and Daniel Kral; 3. Topological connectedness and independent sets in graphs Penny Haxell; 4. Expanders - how to find them, and what to find in them Michael Krivelevich; 5. Supersingular isogeny graphs in cryptography Kristin E. Lauter and Christophe Petit; 6. Delta-matroids for graph theorists Iain Moffatt; 7. Extremal theory of vertex or edge ordered graphs Gabor Tardos; 8. Some combinatorial and geometric constructions of spherical buildings Hendrik Van Maldeghem and Magali Victoor.