M. Ajtai, J. Komlos and E. Szemeredi, “A note on Ramsey numbers,” J. Combin. Theory Ser. A, Vol. 29, 1980, pp. 354-360.

has been cited by the following article:

• TITLE: Friendship Decompositions of Graphs: The general problem

  AUTHORS: Teresa Sousa

  KEYWORDS: Graph Decompositions; Friendship Graph; Friendship Decompositions

  JOURNAL NAME: Open Journal of Applied Sciences, Vol.2 No.4B, January 9, 2013

  ABSTRACT: A friendship graph is a graph consisting of cliques sharing a common vertex. In this paper we investigate the maximum number of elements in an optimal friendship decomposition of graphs of order n. We obtain upper and lower bounds for this number. These bounds relate this problem with the classical Ramsey numbers.