Back to Search
Start Over
Star-critical Ramsey number of large cycle and book of different orders
- Source :
- Theoretical Computer Science. 866:37-42
- Publication Year :
- 2021
- Publisher :
- Elsevier BV, 2021.
-
Abstract
- For graphs F, G and H, let F → ( G , H ) signify that any red/blue edge coloring of F contains either a red G or a blue H. The Ramsey number R ( G , H ) is defined to be the minimum r such that K r → ( G , H ) , and the star-critical Ramsey number R S ( G , H ) is defined to be the maximum t such that K r ∖ K 1 , t → ( G , H ) , where r = R ( G , H ) . In this note, we shall determine R S ( B n , C m ) for almost same orders.
- Subjects :
- Combinatorics
Physics
Edge coloring
General Computer Science
010201 computation theory & mathematics
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
0102 computer and information sciences
02 engineering and technology
Ramsey's theorem
Star (graph theory)
01 natural sciences
Theoretical Computer Science
Subjects
Details
- ISSN :
- 03043975
- Volume :
- 866
- Database :
- OpenAIRE
- Journal :
- Theoretical Computer Science
- Accession number :
- edsair.doi...........91a27f9857b9a788ec4de622db446427