Author(s)

Teresa Sousa

Departamento de Matematica and Centro de Matematica e Aplicac~oes Faculdade de Ci^encias e Tecnologia, Universidade Nova de Lisboa Quinta da Torre, 2829-516 Caparica, Portugal.

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.

Graph Decompositions; Friendship Graph; Friendship Decompositions

Sousa, T. (2012) Friendship Decompositions of Graphs: The general problem. Open Journal of Applied Sciences, 2, 30-33. doi: 10.4236/ojapps.2012.24B008.