5 problems

Hypercube $L^1$-congestion conjecture.

The $H_7$ minimum-congestion conjecture.

Hruska's hypercube congestion conjecture.

Congestion-descent conjecture. Every spanning tree of a complete graph has a congestion descent path to an optimal spanning tree.

Let $U_{\textrm{rout}}(t)$ denote the routing-app control influencing the influx of cars on a highway segment. The road is described by the transformed variables $w$ and $v$, with…