Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

5 results

  • Preface
  • Edited by Artur Czumaj, University of Warwick, Agelos Georgakopoulos, University of Warwick, Daniel Král, University of Warwick, Vadim Lozin, University of Warwick, Oleg Pikhurko, University of Warwick
  • Book: Surveys in Combinatorics 2015
  • Published online: 05 July 2015
  • Print publication: 02 July 2015, pp vii-viii
  • View extract

    Summary

    The 25th British Combinatorial Conference is to take place at the University of Warwick in July 2015. The British Combinatorial Committee has invited nine distinguished combinatorialists to give survey lectures in areas of their expertise. This volume contains the survey articles on which these lectures are to be based.

    We would like to thank the authors for preparing the excellent and interesting surveys, and the anonymous referees for careful reading, in some cases under tight time constraints. Also, we are grateful to the team at the Cambridge University Press, in particular Sam Harrison, for their help, advice, and professionalism. Finally, our task was much simpler thanks to the experience of the editors of earlier Surveys and the guidance of the British Combinatorial Committee.

Surveys in Combinatorics 2015
  • Surveys in Combinatorics 2015
  • Edited by Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim Lozin, Oleg Pikhurko
  • Published online: 05 July 2015
  • Print publication: 02 July 2015
  • View description
    This volume contains nine survey articles based on the invited lectures given at the 25th British Combinatorial Conference, held at the University of Warwick in July 2015. 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, Ramsey theory, combinatorial geometry and curves over finite fields. 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.
  • Testing Expansion in Bounded-Degree Graphs
  • ARTUR CZUMAJ, CHRISTIAN SOHLER
  • Journal: Combinatorics, Probability and Computing / Volume 19 / Issue 5-6 / November 2010
  • Published online by Cambridge University Press: 09 June 2010, pp. 693-709
  • View abstract

    We consider the problem of testing expansion in bounded-degree graphs. We focus on the notion of vertex expansion: an α-expander is a graph G = (V, E) in which every subset U ⊆ V of at most |V|/2 vertices has a neighbourhood of size at least α ⋅ |U|. Our main result is that one can distinguish good expanders from graphs that are far from being weak expanders in time . We prove that the property-testing algorithm proposed by Goldreich and Ron with appropriately set parameters accepts every α-expander with probability at least and rejects every graph that is ϵ-far from any α*-expander with probability at least , where and d is the maximum degree of the graphs. The algorithm assumes the bounded-degree graphs model with adjacency list graph representation and its running time is .