{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematical theory of matroids, a **paving matroid** is a matroid in which every circuit has size at least as large as the matroid's rank. In a matroid of rank $r$ every circuit has size at most $r+1$, so it is equivalent to define paving matroids as the matroids in which the size of every circuit belongs to the set $\\{r,r+1\\}$. It has been conjectured that [[almost all|N1XSAXCQY3]] matroids are paving matroids.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "876E3142F0"
    ],
    "kind": "concept",
    "name": "Paving matroid",
    "same_as": {
      "wikidata": "Q7155894",
      "wikipedia": "Paving matroid"
    },
    "sources": [
      {
        "locator": "Paving matroid",
        "mention": "wikipedia://en/37729421",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:37729421@r1256718365"
      }
    ],
    "tag": "XFWW0NYR6B"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/XFWW0NYR6B/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/XFWW0NYR6B.md",
  "msc": null,
  "name": "Paving matroid",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/XFW/XFWW0NYR6B.md",
  "status": null,
  "tag": "XFWW0NYR6B",
  "uri": "m2://XFWW0NYR6B",
  "url": "https://math2.tamnd.com/wiki/paving-matroid/",
  "writing": {
    "tag": "XFWW0NYR6B",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}