Surveys in Combinatorics 2013 / / edited by Simon R. Blackburn, Stefanie Gerke, Mark Wildon [[electronic resource]]

• Record Nr.: UNINA9910789313203321
• Pubbl/distr/stampa: Cambridge : , : Cambridge University Press, , 2013
• ISBN: 1-139-89407-2; 1-107-27213-0; 1-139-50674-9; 1-107-27546-6; 1-107-27871-6; 1-107-27748-5; 1-107-65195-6; 1-107-27422-2
• Descrizione fisica: 1 online resource (vii, 378 pages) : digital, PDF file(s)
• Collana: London Mathematical Society lecture note series ; ; 409
• Disciplina: 511.6
• Soggetti: Combinatorial analysis; Graph theory
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Title from publisher's bibliographic system (viewed on 05 Oct 2015).
• Nota di bibliografia: Includes bibliographical references at the end of each chapters.
• Nota di contenuto: Preface; 1 Graph removal lemmas; 2 The geometry of covering codes: small complete caps and saturating sets in Galois spaces; 3 Bent functions and their connections to combinatorics; 4 The complexity of change; 5 How symmetric can maps on surfaces be?; 6 Some open problems on permutation patterns; 7 The world of hereditary graph classes viewed through Truemper configurations; 8 Structure in minor-closed classes of matroids; 9 Automatic counting of tilings of skinny plane regions.
• Sommario/riassunto: This volume contains nine survey articles based on the invited lectures given at the 24th British Combinatorial Conference, held at Royal Holloway, University of London in July 2013. 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, matroid ; theory and automatic counting, as well as connections to coding theory and Bent functions. 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.