2019
DOI: 10.22457/apam.621v20n1a2
|View full text |Cite
|
Sign up to set email alerts
|

A Note on Star Critical Ramsey (Cn,K6) Numbers for Large n

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Given two graphs G and H, we say that Kn → (G, H), if any red and blue two colouring of Kn contains a copy of G in red or a copy of H in bue. Studies on Ramsey numbers/Multipartite Ramsey numbers related to different classes have been studied extensively in the past few decades (see [4][5][6][7]9]). Studies on Star-critical Ramsey numbers related to different classes of graphs are trees vs complete graphs [3], paths vs. paths [2], stars vs. stripes [1] and complete graphs vs stripes are some such examples (also see [8,10]).…”
Section: Introductionmentioning
confidence: 99%
“…Given two graphs G and H, we say that Kn → (G, H), if any red and blue two colouring of Kn contains a copy of G in red or a copy of H in bue. Studies on Ramsey numbers/Multipartite Ramsey numbers related to different classes have been studied extensively in the past few decades (see [4][5][6][7]9]). Studies on Star-critical Ramsey numbers related to different classes of graphs are trees vs complete graphs [3], paths vs. paths [2], stars vs. stripes [1] and complete graphs vs stripes are some such examples (also see [8,10]).…”
Section: Introductionmentioning
confidence: 99%