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 Field | Value | Language |
---|---|---|
dc.contributor.author | Surahmat | - |
dc.contributor.author | E.T. Baskoro | - |
dc.date.accessioned | 2024-02-27T06:20:38Z | - |
dc.date.available | 2024-02-27T06:20:38Z | - |
dc.date.issued | 2005 | - |
dc.identifier.uri | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7633 | - |
dc.description.abstract | For 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.publisher | Bulletin of the Institute of Combinatorics and Its Applications | - |
dc.title | The Ramsey Numbers of Fans Versus K 4 | - |
dc.vol | Vol 43 | - |
Appears in Collections: | Articles to be qced |
Files in This Item:
File | Size | Format | |
---|---|---|---|
The Ramsey numbers of Fans versus K 4.pdf Restricted Access | 1.78 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.