# Intersection of two independent sets

I am trying to make sure my intuition for the following question from an assignment is correct

Prove or disrove: if $G = (V, E)$ is a graph and $I_1$ and $I_2$ are independent sets in $G$, then $I_1 \cap I_2$ is an independent set in $G$.

Answer: This statement is true. Consider arbitrary nodes $x, y \in I_1$ and $u, v \in I _2$. Since $I_1$ and $I_2$ are independent sets in $G$, there is no edge between $\{x, y\}$ and there is no edge between $\{ v, u \}$. Similarly, here is no edge between $\{x, u\}$ and $\{v, y\}$ because otherwise, $I_1$ and $I_2$ would have to have nodes that are adjacent two each other. We see that $I_1 \cap I_2 = \emptyset$ and therefore, the statement that $I_1 \cap I_2$ is an independent set in $G$ is vacuously true.

Is this approah necessarily true for any two independent sets in a graph? I would appreciate any feedback

• We discourage "please check whether my answer is correct" questions, as only "yes/no" answers are possible, which won't help you or future visitors. See here and here. Can you edit your post to ask about a specific conceptual issue you're uncertain about? As a rule of thumb, a good conceptual question should be useful even to someone who isn't looking at the problem you happen to be working on. If you just need someone to check your work, you might seek out a friend, classmate, or teacher. – David Richerby Feb 11 '18 at 13:16
• But, by way of feedback, it's not true that there can be no edges between independent sets and your claim that $I_\cap I_2=\emptyset$ doesn't follow from anything you've written, although it is true that $\emptyset$ is vacuously independent – David Richerby Feb 11 '18 at 13:19

Your proof is unfortunately wrong. Consider what happens when $I_1 = I_2$, for example.
• so can I assume (or define $I_1 = I_2$ in my proof? But then this would not be "any" two independent sets but just these two specific ones? I am not sure how to proceed? – user75706 Feb 10 '18 at 21:55
• Is there a similar reasoning behind this statement as well? : Prove or disprove: if $G = (V, E)$ is a graph and $C_1$ and $C_2$ are vertex covers of $G$, then $C_1 \cap C_2$ is a vertex cover of $G$ – user75706 Feb 10 '18 at 22:02