Surveys in Combinatorics, 1999

1999/07/01 by John D. Lamb, D. A. 1939- Preece · 8 citations
Computer Science · Mathematics · #Advanced Mathematical Theories #Ball (mathematics) #Combinatorics #Discrete mathematics #Geometry #Graph Labeling and Dimension Problems #Mathematics #Mathematics and Applications

paper · doi:10.1017/cbo9780511721335

openalex publication_date 1999/07/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/30

Abstract

The British Combinatorial Conference is one of the most well known meetings for combinatorialists. This volume collects the invited talks from the 1999 conference held at the University of Kent and together these span a broad range of combinatorial topics. The nine talks are from: S. Ball, J. Dinitz, M. Dyer, K. Metsch, J. Pach, R. Thomas, C. Thomassen, N. Wormald, plus a special contribution from W. T. Tutte. All researchers into combinatorics will find this volume an outstanding and up-to-date resource.

Cited by

• Finding long cycles in graphs
• Sparse Sachdev-Ye-Kitaev model, quantum chaos, and gravity duals
• Finite plateau in spectral gap of polychromatic constrained random networks
• Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs
• Quantum graphity: A model of emergent locality
• Out-of-equilibrium phase diagram of the quantum random energy model
• On the automorphism group of a binary q-analog of the Fano plane
• Four color theorem [wikipedia]