{
  "aliases": [
    "biconvex-bipartite-graph",
    "convex-bigraph",
    "doubly-convex-bipartite-graph"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematical field of graph theory, a **convex bipartite graph** is a [[bipartite graph|07DVHJ8N0A]] with specific properties. A bipartite graph $(U \\cup V, E)$ is said to be **convex over** the vertex set $U$ if $U$ can be enumerated such that for all $v \\in V$, the vertices adjacent to $v$ are consecutive in the enumeration. Convexity over $V$ is defined analogously. A bipartite graph $(U \\cup V, E)$ that is convex over both $U$ and $V$ is said to be **biconvex** or **doubly convex**.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "biconvex-bipartite-graph",
      "convex-bigraph",
      "doubly-convex-bipartite-graph"
    ],
    "inventory": [
      "AJGWGQQWEY"
    ],
    "kind": "concept",
    "name": "Convex bipartite graph",
    "same_as": {
      "wikidata": "Q5166515",
      "wikipedia": "Convex bipartite graph"
    },
    "sources": [
      {
        "locator": "Convex bipartite graph",
        "mention": "wikipedia://en/23674225",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:23674225@r1351781114"
      }
    ],
    "tag": "7CCQTNR1D1"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/7CCQTNR1D1/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/7CCQTNR1D1.md",
  "msc": null,
  "name": "Convex bipartite graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/7CC/7CCQTNR1D1.md",
  "status": null,
  "tag": "7CCQTNR1D1",
  "uri": "m2://7CCQTNR1D1",
  "url": "https://math2.tamnd.com/wiki/convex-bipartite-graph/",
  "writing": {
    "tag": "7CCQTNR1D1",
    "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
      }
    ]
  }
}