1 problem

Let $G$ be an $n$-vertex graph, and let $\alpha(G)$ denote its independence number. Independence-number clique immersion conjecture. The graph $G$ contains … as an immersion. This…