Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Extremal Competition Numbers as a Generalization of Turin's Theorem


Affiliations
1 Department of Computer Science, New Mexico State University, Las Cruces, NM 88003, United States
2 Math and Science Division, St. John's University, Staten Island, NY 10301, United States
3 Department of Mathematics, Rutgers University, New Brunswick, N.J. 08903, Canada
     

   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
Notifications
Font Size

Abstract Views: 236

PDF Views: 0




  • Extremal Competition Numbers as a Generalization of Turin's Theorem

Abstract Views: 236  |  PDF Views: 0

Authors

Frank Harary
Department of Computer Science, New Mexico State University, Las Cruces, NM 88003, United States
Suh-Ryung Kim
Math and Science Division, St. John's University, Staten Island, NY 10301, United States
Fred S. Roberts
Department of Mathematics, Rutgers University, New Brunswick, N.J. 08903, Canada

Abstract


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.