
Surveys in Combinatorics 2017
- English
- PDF
- Available on iOS & Android
Surveys in Combinatorics 2017
About this book
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.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Series page
- Title page
- Copyright information
- Table of contents
- Preface
- Relations among partitions
- Large-scale structures in random graphs
- The spt-Function of Andrews
- Combinatorial structures in finite classical polar spaces
- Switching techniques for edge decompositions of graphs
- Ramsey-Type and Amalgamation-Type Properties of Permutations
- Monotone cellular automata
- Robustness of graph properties
- Some Applications of Relative Entropy in Additive Combinatorics