2 problems

A weak link is a Shannon-game link with two terminals; its weight $w$ is its number of vertices, and $d_{\rm max}$ denotes its maximum vertex degree. The preceding discussion conce…

A minimal weak link is a weak link that is minimal under the relevant notion of link containment; its weight $w$ is the number of vertices, and P-reducibility and T-reducibility ar…