Title of article
Star-critical connected Ramsey numbers for 2-colorings of complete graphs
Author/Authors
Moun ، Monu Department of Mathematics - Central University of Haryana , Jakhar ، Jagjeet Department of Mathematics - Central University of Haryana , Budden ، Mark Department of Mathematics and Computer Science - Western Carolina University
From page
211
To page
222
Abstract
This paper builds upon Sumner’s work by further investigating the concept of connected Ramsey numbers, specifically focusing on star-critical connected Ramsey numbers. We obtain starcritical connected Ramsey numbers for several cases of trees versus complete graphs, stars versus stars, and paths versus paths. The connected Ramsey number for a star versus K3 is also evaluated. Exact values are also obtained for the connected Ramsey numbers of K1,n versus K3. This research explores the interplay between connectivity and graph coloring within the context of Ramsey theory.
Keywords
Ramsey number , connected Ramsey number , star , critical Ramsey number
Journal title
Transactions on Combinatorics
Journal title
Transactions on Combinatorics
Record number
2772555
Link To Document