
Why One More Step Can Shrink a Network’s Required Seed Set
A directed-graph puzzle reveals why one more step can make a tiny set reach every node—and why the two-step version remains open.

A directed-graph puzzle reveals why one more step can make a tiny set reach every node—and why the two-step version remains open.

A simple missing-value rule connects partitions, paths, and trees—and hints at an unexplained mirror in inversion sequences.