1 problem

Let $G$ be a simple graph, let $v\in V(G)$, and let $G-v$ denote the graph obtained by deleting $v$. Twin-pair conjecture. If … then $G$ has at least one pair of twin vertices. Thi…