What would be the negation of the following statement? "There exist vertices $u$ and $v$ of $G$ such that the edge $x$ is on every path joining $u$ and $v$."
Would it be, "there exist vertices $u$ and $v$ of $G$ such that the edge $x$ is on every path joining $u$ and $v$" or "There does not exist vertices $u$ and $v$ of $G$ such that the edge $x$ is on every path joining $u$ and $v$"?
Thanks for your help!
Your second suggestion is correct: the negation of
is
However, this can often be phrased more perspicuously. Saying that
is equivalent to saying that
(And if you’ve learned a little graph-theoretic terminology, you can work out that this is just saying that if you remove the edge $x$ from $G$, the graph that remains is connected.)