Star-critical Ramsey numbers for graphs
Author(s)
Bibliographic Information
Star-critical Ramsey numbers for graphs
（SpringerBriefs in mathematics）
Springer, c2023
- :pbk.
Available at / 2 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
by "Nielsen BookData"