A note on the Ramsey number for cycle with respect to multiple copies of wheels
Let Kn be a complete graph with n vertices. For graphs G and H, the Ramsey number R(G, H) is the smallest positive integer n such that in every red-blue coloring on the edges of Kn, there is a red copy of graph G or a blue copy of graph H in Kn. Determining the Ramsey number R(Cn, tWm) for any integ...
Saved in:
| Main Author: | |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-10-16.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |