Description

Book Synopsis
​This book collects some surveys on current trends in discrete mathematics and discrete geometry. The areas covered include: graph representations, structural graphs theory, extremal graph theory, Ramsey theory and constrained satisfaction problems.

Table of Contents
Imre Bárány: Tensors, colours, octahedral.- Maria Chudnovsky: Cliques and stable sets in undirected graphs.- Mauro Di Nasso: A taste of nonstandard methods in combinatorics of numbers.- Béla Bollobás, Zoltán Füredi, Ida Kantor, G. O. H. Katona and Imre Leader: A coding problem for pairs of subsets.- Jirí Matousek: String graphs and separators.- Jaroslav Nesetril and Patrice Ossona de Mendez: On first-order definable colorings.- Ryan Schwartz and József Solymosi: Combinatorial applications of the subspace theorem.- Peter Hegarty and Dmitry Zhelezov: Can connected commuting graphs of finite groups have arbitrarily large diameter?

Geometry, Structure and Randomness in

    Product form

    £24.69

    Includes FREE delivery

    RRP £25.99 – you save £1.30 (5%)

    Order before 4pm today for delivery by Thu 6 Aug 2026.

    A Paperback / softback by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini

    3 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Geometry, Structure and Randomness in by Jiří Matousek

      Publisher: Birkhauser Verlag AG
      Publication Date: Publication Date: 02/04/2015
      ISBN13: 9788876425240, 978-8876425240
      ISBN10: 8876425241
      Also in:
      Discrete mathematics Geometry

      Description

      Book Synopsis
      ​This book collects some surveys on current trends in discrete mathematics and discrete geometry. The areas covered include: graph representations, structural graphs theory, extremal graph theory, Ramsey theory and constrained satisfaction problems.

      Table of Contents
      Imre Bárány: Tensors, colours, octahedral.- Maria Chudnovsky: Cliques and stable sets in undirected graphs.- Mauro Di Nasso: A taste of nonstandard methods in combinatorics of numbers.- Béla Bollobás, Zoltán Füredi, Ida Kantor, G. O. H. Katona and Imre Leader: A coding problem for pairs of subsets.- Jirí Matousek: String graphs and separators.- Jaroslav Nesetril and Patrice Ossona de Mendez: On first-order definable colorings.- Ryan Schwartz and József Solymosi: Combinatorial applications of the subspace theorem.- Peter Hegarty and Dmitry Zhelezov: Can connected commuting graphs of finite groups have arbitrarily large diameter?

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account