GNRS conjecture
Statement
In theoretical computer science and metric geometry, the GNRS conjecture connects the theory of graph minors, the stretch factor of embeddings, and the approximation ratio of multi-commodity flow problems. It is named after Anupam Gupta, Ilan Newman, Yuri Rabinovich, and Alistair Sinclair, who formulated it in 2004.
Further reading
- Wikipedia, page 59652628, revision 1329671212, GNRS conjecture. adopted
About this page
| Tag | 40751QDJKS |
|---|---|
| URI | m2://40751QDJKS |
| Kind | conjecture |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status 40751QDJKS. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.