The maximum number of edges in a graph w
β
R.J. Faudree; J. Sheehan
π
Article
π
1998
π
Elsevier Science
π
English
β 633 KB
Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.