![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Extremal Competition Numbers as a Generalization of Turin's Theorem
Subscribe/Renew Journal
Turan's famous theorem says that a graph of n points and no triangles can have no more than [n2/4] lines, and this bound is achieved only by the complete bipartite graph K in([n/2j, [n/2]). We now show that any graph of n points can have competition number no higher than [n2 /4] - n + 2, and this bound is achieved only by K ([n/2],[n/2]), and K3. Turan's Theorem follows as a special case.
Keywords
Triangulated Graph, Competition Number, Turan's Theorem.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 193
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0