Another extremal problem for Turan graphs (Q1093651): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90139-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2016908703 / rank | |||
Normal rank |
Latest revision as of 11:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Another extremal problem for Turan graphs |
scientific article |
Statements
Another extremal problem for Turan graphs (English)
0 references
1987
0 references
Let K(G) and \(\omega\) (G) be the clique graph and clique number of a graph G. For \(1<r<n\), let \(F(n,r)=\max_{G}\{| K(G)|:| V(G)| =n\) and \(\omega (G)=r\}\). A Turan graph \(T(n,r)\) is a multipartite graph with vertices \(v_ 1,v_ 2,...,v_ n\), and \(v_ iv_ j\in E(G)\) if and only if \(i\neq j\) (mod r). Theorem: Let G be a graph of order n with \(\omega (G)=r<n\). Then \(| K(G)| =F(n,r)\) if and only if \(G\sim T(n,r)\).
0 references
clique graph
0 references
clique number
0 references
Turan graph
0 references
multipartite graph
0 references