大葉大學圖書館 |

Surveys in combinatorics 2017[electronic resource] /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	511.6
書名/作者:	Surveys in combinatorics 2017/ edited by Anders Claesson ... [et al.].
其他作者:	Claesson, Anders.
團體作者:	British Combinatorial Conference
出版者:	Cambridge : : Cambridge University Press,, 2017.
面頁冊數:	vii, 442 p. : : ill., digital ;; 24 cm.
附註:	Title from publisher's bibliographic system (viewed on 11 Aug 2017).
標題:	Combinatorial analysis
標題:	Graph theory
ISBN:	9781108332699
ISBN:	9781108413138
摘要、提要註:	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.
電子資源:	https://doi.org/10.1017/9781108332699

Surveys in combinatorics 2017[electronic resource] /
Surveys in combinatorics 2017[electronic resource] /edited by Anders Claesson ... [et al.]. - Cambridge :Cambridge University Press,2017. - vii, 442 p. :ill., digital ;24 cm. - London Mathematical Society lecture note series ;440. - London Mathematical Society lecture note series ;402..

Title from publisher's bibliographic system (viewed on 11 Aug 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. 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.

ISBN: 9781108332699Subjects--Topical Terms:

136046
Combinatorial analysis

LC Class. No.: QA164 / .B74 2017

Dewey Class. No.: 511.6

Surveys in combinatorics 2017[electronic resource] /
LDR:01727nmm a2200265 a 4500 001 524873
003 UkCbUP
005 20190215113127.0
006 m d
007 cr nn 008maaau
008 230513s2017 enka o 1 0 eng d
020 $a 9781108332699 $q (electronic bk.)
020 $a 9781108413138 $q (paper)
035 $a CR9781108332699
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA164 $b .B74 2017
082 0 4 $a 511.6 $2 23
090 $a QA164 $b .B862 2017
111 2 $a British Combinatorial Conference $n (26th : $d 2017 : $c University of Strathclyde) $3 752198
245 1 0 $a Surveys in combinatorics 2017 $h [electronic resource] / $c edited by Anders Claesson ... [et al.].
260 $a Cambridge : $b Cambridge University Press, $c 2017.
300 $a vii, 442 p. : $b ill., digital ; $c 24 cm.
490 1 $a London Mathematical Society lecture note series ; $v 440
500 $a Title from publisher's bibliographic system (viewed on 11 Aug 2017).
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.
650 0 $a Combinatorial analysis $3 136046
650 0 $a Graph theory $3 136007
700 1 $a Claesson, Anders. $3 752199
830 0 $a London Mathematical Society lecture note series ; $v 402. $3 711187
856 4 0 $u https://doi.org/10.1017/9781108332699