MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This strongly relates to an earlier question of mine.

Let $G$ be a graph, $\alpha(G)$ its independence number and $\Theta(G)$ its Shannon capacity.

Question: can one 'add new vertices' to $G$ such that $G\subseteq G'$ becomes an induced subgraph of some well-covered $G'$ with $\alpha(G')=\alpha(G)$ and $\Theta(G') = \Theta(G)$?

If so, this would be a way to 'uniformize' a graph without changing its Shannon capacity. Has anyone considered this question before?


share|cite|improve this question
The new one added vertex should be adjacency with each vertex which can be in a maximum independent set at least. – Eden Harder Mar 25 '14 at 1:09

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.