3 problems

Intrinsic-linking conjecture. A graph $G$ is intrinsically linked if and only if every maximal planar subgraph of $G$ has every possible conflict graph unbalanced.

Let the 35 minor-minimal nonprojective-planar graphs be the graphs described in the preceding discussion, and let $K_1$ denote the graph consisting of a single vertex. Consider the…

Let $K_n$ denote the complete graph on $n$ vertices, let $K_{n_1,n_2}$ denote the complete bipartite graph with parts of sizes $n_1$ and $n_2$, and let $G\dot{\bigcup}H$ denote the…