{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nIn 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.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "9CQS2FGKEQ"
    ],
    "kind": "conjecture",
    "name": "GNRS conjecture",
    "same_as": {
      "wikidata": "Q60792994",
      "wikipedia": "GNRS conjecture"
    },
    "sources": [
      {
        "locator": "GNRS conjecture",
        "mention": "wikipedia://en/59652628",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:59652628@r1329671212"
      }
    ],
    "tag": "40751QDJKS"
  },
  "kind": "conjecture",
  "link": "https://math2.tamnd.com/node/40751QDJKS/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/40751QDJKS.md",
  "msc": null,
  "name": "GNRS conjecture",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/407/40751QDJKS.md",
  "status": null,
  "tag": "40751QDJKS",
  "uri": "m2://40751QDJKS",
  "url": "https://math2.tamnd.com/wiki/gnrs-conjecture/",
  "writing": {
    "tag": "40751QDJKS",
    "kind": "conjecture",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "have": 0,
        "want": 1
      }
    ]
  }
}