1
$\begingroup$

If $G=(V,E)$ is a finite graph, let the Hadwiger number $\eta(G)$ equal the largest integer $n$ such that the complete graph $K_n$ is a minor of $G$.

Is there a bipartite graph $G$ on more than $3$ vertices such that whenever $2$ non-adjacent vertices are collapsed, then the Hadwiger number increases?

$\endgroup$

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.