Surveys in combinatorics 2017

This volume contains nine survey articles which provide expanded accounts of plenary seminars given at the British Combinatorial Conference at the University of Strathclyde in July 2017. This biennial conference is a well-established international event attracting speakers from around the world. Wri...

Full description

Bibliographic Details
Corporate Author: British Combinatorial Conference ( 2017, University of Strathclyde)
Other Authors: Claesson, Anders (Editor)
Format: eBook
Language:English
Published: Cambridge Cambridge University Press 2017
Series:London Mathematical Society lecture note series
Subjects:
Online Access:
Collection: Cambridge Books Online - Collection details see MPG.ReNa
LEADER 01799nmm a2200277 u 4500
001 EB001542355
003 EBX01000000000000000940441
005 00000000000000.0
007 cr|||||||||||||||||||||
008 170804 ||| eng
020 |a 9781108332699 
050 4 |a QA164 
100 1 |a Claesson, Anders  |e [editor] 
245 0 0 |a Surveys in combinatorics 2017  |c edited by Anders Claesson [and four others] 
260 |a Cambridge  |b Cambridge University Press  |c 2017 
300 |a vii, 442 pages  |b digital 
653 |a Combinatorial analysis / Congresses 
653 |a Graph theory / Congresses 
710 2 |a British Combinatorial Conference ( 2017, University of Strathclyde) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b CBO  |a Cambridge Books Online 
490 0 |a London Mathematical Society lecture note series 
028 5 0 |a 10.1017/9781108332699 
856 4 0 |u https://doi.org/10.1017/9781108332699  |x Verlag  |3 Volltext 
082 0 |a 511.6 
520 |a This volume contains nine survey articles which provide expanded accounts of plenary seminars given at the British Combinatorial Conference at the University of Strathclyde in July 2017. This biennial conference is a well-established international event attracting speakers from around the world. Written by internationally recognised experts in the field, these articles represent a timely snapshot of the state of the art in the different areas of combinatorics. Topics covered include the robustness of graph properties, the spt-function of Andrews, switching techniques for edge decompositions of graphs, monotone cellular automata, and applications of relative entropy in additive combinatorics. The book will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics