Pathfan Ramsey numbers
Salman, A.N.M. and Broersma, H.J. (2003) Pathfan Ramsey numbers. [Report]

PDF
585kB 
Abstract:  For two given graphs and , the Ramsey number is the smallest positive integer such that for every graph on vertices the following holds: either contains as a subgraph or the complement of contains as a subgraph. In this paper, we study the Ramsey numbers , where is a path on vertices and is the graph obtained from disjoint triangles by identifying precisely one vertex of every triangle ( is the join of and ). We determine exact values for for the following values of and : or and ; and ; and or ; and with ; or and ; and . We conjecture that for the other values of and .

Item Type:  Report 
Additional information:  Imported from MEMORANDA 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/65888 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page