The Cycle-Complete Graph Ramsey Number r(C9,K8)
Joint Authors
al-Zaleq, L. M. N.
Jaradat, M. M. M.
Bataineh, M. S. A.
Source
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-07-21
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
It has been conjectured by Erdős, Faudree, Rousseau, and Schelp that r(Cm,Kn)=(m-1)(n-1)+1 for all (m,n)≠(3,3) satisfying that m≥n≥3 (except r(C3,K3)=6).
In this paper, we prove this for the case m=9 and n=8.
American Psychological Association (APA)
Bataineh, M. S. A.& Jaradat, M. M. M.& al-Zaleq, L. M. N.. 2011. The Cycle-Complete Graph Ramsey Number r(C9,K8). ISRN Algebra،Vol. 2011, no. 2011, pp.1-10.
https://search.emarefa.net/detail/BIM-508657
Modern Language Association (MLA)
Bataineh, M. S. A.…[et al.]. The Cycle-Complete Graph Ramsey Number r(C9,K8). ISRN Algebra No. 2011 (2011), pp.1-10.
https://search.emarefa.net/detail/BIM-508657
American Medical Association (AMA)
Bataineh, M. S. A.& Jaradat, M. M. M.& al-Zaleq, L. M. N.. The Cycle-Complete Graph Ramsey Number r(C9,K8). ISRN Algebra. 2011. Vol. 2011, no. 2011, pp.1-10.
https://search.emarefa.net/detail/BIM-508657
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-508657
