Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7633
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSurahmat-
dc.contributor.authorE.T. Baskoro-
dc.date.accessioned2024-02-27T06:20:38Z-
dc.date.available2024-02-27T06:20:38Z-
dc.date.issued2005-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7633-
dc.description.abstractFor two given graphs G and H, the Ramsey number R( G, H) is the smallest positive integer N such that for every graph F of order N the following holds- either F contains G as a subgraph or the complement of F contains H as a subgraph. In this paper, we determine the Ramsey number R(F1, K4), where Fl is the graph obtained from l disjoint triangles by identifying precisely one vertex of every triangle (Fl is the join of K1 and lK2) .-
dc.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.titleThe Ramsey Numbers of Fans Versus K 4-
dc.volVol 43-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
The Ramsey numbers of Fans versus K 4.pdf
  Restricted Access
1.78 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.