Large joints in graphs (Q607362): Difference between revisions

The Turan \(r\)-partite graph of order \(n\), \(T_{r}(n)\), is the complete \(r\)-partite graph so that the sizes of any two parts differ by at most 1. It is proved in the paper that if \(r\geq 2\), \(n>r^8\), and \(G\) is a graph of order \(n\) so that, for some \(s\leq r\), the number of \(s\)-cliques of \(G\) \(\geq \) the number of \(s\)-cliques of \(T_{k}(n)\), then \(G\) contains more than \(n^{r-1}/r^{2r+12}\) \(r\)-cliques sharing a common edge unless G=\(T_{r}(n)\). This result generalizes a result that turned out to be useful in extremal graph theory.