{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "SMHMFA15HG"
    },
    {
      "field": "uses",
      "target": "TBSBNJFD2P"
    }
  ],
  "body": "\n## Summary\n\nThe comparability graph of a [[partially ordered set|0QV2JS9RJ3]] joins two elements by an edge when they are comparable.\nA graph is a comparability graph when it arises in this way from some partial order.\nChains become cliques and antichains become independent sets, so order results such as [[Mirsky's theorem|5VPXR3RDF1]] turn into graph results.\nComparability graphs are [[perfect graphs|1YZ7NV161A]].\n\n## Explanations\n\n### L1 human\n\nStart from a poset and forget which element is the smaller one in each related pair.\nWhat remains is an ordinary [[graph|00C0BR7D7H]]: an edge just says \"these two are related\".\nFor the divisors of $6$, the graph has edges $1$–$2$, $1$–$3$, $1$–$6$, $2$–$6$ and $3$–$6$, but no edge $2$–$3$.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "05C75",
      "06A07",
      "05C17"
    ],
    "name": "Comparability graph",
    "same_as": {
      "wikidata": "Q5155607",
      "wikipedia": "Comparability graph"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Comparability_graph"
      }
    ],
    "tag": "1P4830BH6Z"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/1P4830BH6Z/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/1P4830BH6Z.md",
  "msc": [
    "05C75",
    "06A07",
    "05C17"
  ],
  "name": "Comparability graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/1P4/1P4830BH6Z.md",
  "status": null,
  "tag": "1P4830BH6Z",
  "uri": "m2://1P4830BH6Z",
  "url": "https://tamnd.github.io/math2/wiki/comparability-graph/",
  "writing": {
    "tag": "1P4830BH6Z",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}
