What do you call a lower/upper bound that is the best one? I have developed an upper bound on the number of vertices of a particular graph. This bound is the best possible bound that can be found for any given instance. What do you call such a bound? If it were an optimization problem then I would call it the optimal value or the optimal bound. Is that right?
The phrase you're looking for is tight bound or in your case a tight upper bound.