Note: On multicolour noncomplete Ramsey graphs of star graphs

  • Authors:

  • Sachin Gautam;Ashish Kumar Srivastava;Amitabha Tripathi

  • Affiliations:

  • Department of Computer Science & Engineering, Indian Institute of Technology, Hauz Khas, New Delhi-110 016, India;Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi - 110 016, India;Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi - 110 016, India

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2008

Quantified Score

Hi-index 0.04

Visualization

Abstract

Given graphs G,G"1,...,G"k, where k=2, the notation G-(G"1,G"2,...,G"k) denotes that every factorization F"1@?F"2@?...@?F"k of G implies G"i@?F"i for at least one i, 1@?i@?k. We characterize G for which G-(K(1,n"1),K(1,n"2),...,K(1,n"k)) and derive some consequences from this. In particular, this gives the value of the graph Ramsey number R(K(1,n"1),K(1,n"2),...,K(1,n"k)).