1 problem

Gupta–Newman–Rabinovich–Sinclair conjecture on minor-closed flow gaps
Gupta–Newman–Rabinovich–Sinclair conjecture. For every family of finite graphs $\mathcal F$ , one has
opengraph-minors metric-embeddings multicommodity-flows
0 responses
04

Gupta–Newman–Rabinovich–Sinclair conjecture on minor-closed flow gaps