Open Access
Subscription Access
Open Access
Subscription Access
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
Abstract Views: 236
PDF Views: 0