Consider a simple connected graph $G$ with n vertices and n edges $(n>2)$. Then, which of the following statements are true?
- $G$ has no cycles
- The graph obtained by removing any edge from $G$ is not connected
- $G$ has at least one cycle
- The graph obtained by removing any two edges from $G$ is not connected
My attempt :
- always false
- not always true
- true (since exactly one is subset of at least one !).
- always true
Can you explain in formal way, please?