Description: |
A set of convex quadratic bounds on the stability number of a graph is introduced. A characterization of the famous Lovász theta number is established by proving that:
a) This number is never worse than any of the above bounds and,
b) It equals one of the above bounds.
Further issues related with this topic are also discussed.
Area(s):
|