Description

Book Synopsis

This text is a comprehensive survey of the literature surrounding star-critical Ramsey numbers. First defined by Jonelle Hook in her 2010 dissertation, these numbers aim to measure the sharpness of the corresponding Ramsey numbers by determining the minimum number of edges needed to be added to a critical graph for the Ramsey property to hold. Despite being in its infancy, the topic has gained significant attention among Ramsey theorists.

This work provides researchers and students with a resource for studying known results and their complete proofs. It covers typical results, including multicolor star-critical Ramsey numbers for complete graphs, trees, cycles, wheels, and n-good graphs, among others. The proofs are streamlined and, in some cases, simplified, with a few new results included. The book also explores the connection between star-critical Ramsey numbers and deleted edge numbers, which focus on destroying the Ramsey property by removing edges.

The book concludes with open problems and conjectures for researchers to consider, making it a valuable resource for those studying the field of star-critical Ramsey numbers.



Table of Contents
1. Multi Star-Critical Ramsey Numbers.- 2. Non-Complete Graphs.- 3. Generalizations of Star-Critical Ramsey Numbers.- 4. Open Problems.

Star-Critical Ramsey Numbers for Graphs

    Product form

    £29.99

    Includes FREE delivery

    RRP £39.99 – you save £10.00 (25%)

    Order before 4pm today for delivery by Wed 24 Jun 2026.

    A Paperback by Mark R. Budden

    1 in stock


      View other formats and editions of Star-Critical Ramsey Numbers for Graphs by Mark R. Budden

      Publisher: Springer International Publishing AG
      Publication Date: 14/05/2023
      ISBN13: 9783031299803, 978-3031299803
      ISBN10:

      Description

      Book Synopsis

      This text is a comprehensive survey of the literature surrounding star-critical Ramsey numbers. First defined by Jonelle Hook in her 2010 dissertation, these numbers aim to measure the sharpness of the corresponding Ramsey numbers by determining the minimum number of edges needed to be added to a critical graph for the Ramsey property to hold. Despite being in its infancy, the topic has gained significant attention among Ramsey theorists.

      This work provides researchers and students with a resource for studying known results and their complete proofs. It covers typical results, including multicolor star-critical Ramsey numbers for complete graphs, trees, cycles, wheels, and n-good graphs, among others. The proofs are streamlined and, in some cases, simplified, with a few new results included. The book also explores the connection between star-critical Ramsey numbers and deleted edge numbers, which focus on destroying the Ramsey property by removing edges.

      The book concludes with open problems and conjectures for researchers to consider, making it a valuable resource for those studying the field of star-critical Ramsey numbers.



      Table of Contents
      1. Multi Star-Critical Ramsey Numbers.- 2. Non-Complete Graphs.- 3. Generalizations of Star-Critical Ramsey Numbers.- 4. Open Problems.

      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