LEADER 03680nam  22007092  450 
001 9910823256503321
005 20240314013413.0
010   $a1-139-89407-2
010   $a1-107-27213-0
010   $a1-139-50674-9
010   $a1-107-27546-6
010   $a1-107-27871-6
010   $a1-107-27748-5
010   $a1-107-65195-6
010   $a1-107-27422-2
035   $a(CKB)3460000000128953
035   $a(EBL)1303752
035   $a(OCoLC)854975225
035   $a(SSID)ssj0001169002
035   $a(PQKBManifestationID)11683964
035   $a(PQKBTitleCode)TC0001169002
035   $a(PQKBWorkID)11145947
035   $a(PQKB)11063170
035   $a(UkCbUP)CR9781139506748
035   $a(Au-PeEL)EBL1303752
035   $a(CaPaEBR)ebr10740492
035   $a(CaONFJC)MIL508541
035   $a(MiAaPQ)EBC1303752
035   $a(PPN)261316060
035   $a(EXLCZ)993460000000128953
100   $a20120514d2013||||  uy|         0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 00$aSurveys in Combinatorics 2013 /$fedited by Simon R. Blackburn, Stefanie Gerke, Mark Wildon$b[electronic resource]
205   $a1st ed.
210  1$aCambridge :$cCambridge University Press,$d2013.
215   $a1 online resource (vii, 378 pages) $cdigital, PDF file(s)
225 1 $aLondon Mathematical Society lecture note series ;$v409
300   $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
311   $a1-299-77290-0 
311   $a1-107-27281-5 
320   $aIncludes bibliographical references at the end of each chapters.
327   $aPreface; 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.
330   $aThis 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.
410  0$aLondon Mathematical Society lecture note series ;$v409.
606   $aCombinatorial analysis
606   $aGraph theory
615  0$aCombinatorial analysis.
615  0$aGraph theory.
676   $a511.6
702   $aBlackburn$b Simon R.
702   $aGerke$b Stefanie
702   $aWildon$b Mark J.
801  0$bUkCbUP
801  1$bUkCbUP
906   $aBOOK
912   $a9910823256503321
996   $aSurveys in combinatorics 2013$9832631
997   $aUNINA