On multicolour noncomplete Ramsey graphs of star graphs.pdfVIP

Discrete Applied Mathematics 156 (2008) 2423–2428 /locate/dam Note On multicolour noncomplete Ramsey graphs of star graphs Sachin Gautama,1, Ashish Kumar Srivastavab,2 , Amitabha Tripathib,∗ a Department of Computer Science Engineering, Indian Institute of Technology, Hauz Khas, New Delhi-110 016, India b Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi - 110 016, India Received 27 January 2006; received in revised form 7 October 2007; accepted 23 October 2007 Available online 26 December 2007 Abstract Given graphs G, G1, . . . , Gk , where k ≥ 2, the notation G → (G , G , . . . , G ) 1 2 k denotes that every factorization F1 ⊕ F2 ⊕ · · · ⊕ Fk of G implies Gi ⊆ Fi for at least one i , 1 ≤ i ≤ k . We characterize G for which G → (K(1, n 1), K(1, n2), . . . , K(1, nk )) and derive some consequences from this. In particular, this gives the value of the graph Ramsey number R(K(1, n 1), K(1, n2), . . . , K(1, nk )). c 2007 Elsevier B.V. All rights reserved. Keywords: Factorization; r -factor; r -factorable; Edge chromatic number; k -regularization 1. Introduction Noncomplete Ramsey Theory concerns itself with the factorization of noncomplete graphs. More specifically, given graphs G , G , . . . , G , where k ≥ 2, we use the standard notation 1 2 k G → (G , G , . . . , G ) (1) 1 2 k to mean that for eve