Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

On the Ramsey Number for a Linear Forest Versus a Cocktail Party Graph

Kashif Ali1, A.Q. Baig2, Edy Tri Baskoro3
1 COMSATS Institute of Information Technology, Faculty of Mathematical Sciences, Lahore, Pakistan,
2Abdus Salam School of Mathematical Sciences, Government College University, 68-B, New Muslim Town, Lahore Pakistan
3Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Bandung Institute of Technology (Institut Teknologi Bandung) Jalan Ganesa 10 Bandung 40132, Indonesia,
  • Published: 30/11/2009

Abstract

For given graphs \( G \) and \( H \), the \({Ramsey\; number}\) \( R(G, H) \) is the least natural number \( n \) such that for every graph \( F \) of order \( n \) the following condition holds: either \( F \) contains \( G \) or the complement of \( F \) contains \( H \). In this paper, we determine the Ramsey number for a disjoint union of paths versus the cocktail party graph.

Keywords: Ramsey number, path, cocktail party graph.
Citation
Kashif Ali, A.Q. Baig, Edy Tri Baskoro. On the Ramsey Number for a Linear Forest Versus a Cocktail Party Graph[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 071. 173-177. .