menu
{ "item_title" : "Surveys in Combinatorics 2017", "item_author" : [" Anders Claesson", "Mark Dukes", "Sergey Kitaev "], "item_description" : "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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/1/10/841/313/1108413137_b.jpg", "price_data" : { "retail_price" : "134.00", "online_price" : "134.00", "our_price" : "134.00", "club_price" : "134.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Surveys in Combinatorics 2017|Anders Claesson

Surveys in Combinatorics 2017

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9781108413138
  • ISBN-10: 1108413137
  • Publisher: Cambridge University Press
  • Publish Date: June 2017
  • Dimensions: 9.12 x 6.42 x 0.98 inches
  • Shipping Weight: 1.47 pounds
  • Page Count: 448

Related Categories

You May Also Like...

    1

BAM Customer Reviews