Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
38 views

Hadwiger number in vertex collapse in a bipartite graph

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$ ...
Dominic van der Zypen's user avatar