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

PDF
198kB 
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 the join of and . We determine the exact values of for the following values of and : and ; and ( is odd, ) or ( is even, ); and or ; and or or with or ; odd and with or with . Moreover, we give lower bounds and upper bounds for 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/65927 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page
Metis ID: 220232