{
  "aliases": [
    "zig-zag-product-of-graphs"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, the **zig-zag product** of [[regular graphs|0KA4S8R39M]] $G,H$, denoted by $G \\circ H$, is a binary operation which takes a large graph ($G$) and a small graph ($H$) and produces a graph that approximately inherits the size of the large one but the [[degree|0KS0KRDV4Y]] of the small one. An important property of the zig-zag product is that if $H$ is a good expander, then the expansion of the resulting graph is only slightly worse than the expansion of $G$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "zig-zag-product-of-graphs"
    ],
    "inventory": [
      "YZTAJHVY7C"
    ],
    "kind": "concept",
    "name": "Zig-zag product",
    "same_as": {
      "wikidata": "Q8071744",
      "wikipedia": "Zig-zag product"
    },
    "sources": [
      {
        "locator": "Zig-zag product",
        "mention": "wikipedia://en/24387478",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:24387478@r1334351454"
      }
    ],
    "tag": "JQKW6608PT"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/JQKW6608PT/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/JQKW6608PT.md",
  "msc": null,
  "name": "Zig-zag product",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/JQK/JQKW6608PT.md",
  "status": null,
  "tag": "JQKW6608PT",
  "uri": "m2://JQKW6608PT",
  "url": "https://math2.tamnd.com/wiki/zig-zag-product/",
  "writing": {
    "tag": "JQKW6608PT",
    "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
      }
    ]
  }
}
