Ramsey Numbers for Connected 2-Colorings of Complete Graphs
In 1978, David Sumner introduced a variation of Ramsey numbers by restricting to 2-colorings in which the subgraphs spanned by edges in each color are connected. This paper continues the study of connected Ramsey numbers, including the evaluation of several cases of trees versus complete graphs.
Main Author: | Mark Budden |
---|---|
Format: | Article |
Language: | English |
Published: |
Georgia Southern University
2023-01-01
|
Series: | Theory and Applications of Graphs |
Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol10/iss1/7/ |
Similar Items
-
Multicolor star-critical Ramsey numbers and Ramsey-good graphs
by: Mark Rowland Budden, et al.
Published: (2022-03-01) -
The Ramsey number of dense graphs
by: Conlon, D
Published: (2012) -
The multicolor star-critical Gallai-Ramsey number for a path of order 5
by: Mark Budden
Published: (2023-10-01) -
The Ramsey numbers of fans versus a complete graph of order five
by: Yanbo Zhang, et al.
Published: (2014-04-01) -
Anti-Ramsey Number of Hanoi Graphs
by: Gorgol Izolda, et al.
Published: (2019-02-01)