Friendship decompositions of graphs

We investigate the maximum number of elements in an optimal t-friendship decomposition of graphs of order n  . Asymptotic results will be obtained for all fixed t⩾4t⩾4 and for t=2,3t=2,3 exact results will be derived.