Star-Critical Ramsey Numbers for Graphs

ISBN-13: 9783031299803 / Angielski

Mark R. Budden

Opis

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.

Spis treści

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

O autorze

​

Mark Budden: Originally born in Baton Rouge, Louisiana, Mark Budden earned his Ph.D. in Mathematics from the University of Missouri-Columbia in 2003.  From 2003-2010, he worked as a faculty member in the Department of Mathematics at Armstrong Atlantic State University (now Georgia Southern University’s Armstrong campus) in Savannah, Georgia.  In 2010, he joined the faculty at Western Carolina University in Cullowhee, North Carolina, where he is now a Professor in the Department of Mathematics and Computer Science.  Mark’s research interests span many topics in graph theory and number theory, and he places special emphasis on engaging undergraduate students in research projects.