{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nIn mathematics, the **Beck–Fiala theorem** is a major theorem in discrepancy theory due to József Beck and Tibor Fiala. Discrepancy is concerned with coloring elements of a ground set such that each set in a certain set system is as balanced as possible, i.e., has approximately the same number of elements of each color. The Beck–Fiala theorem is concerned with the case where each element doesn't appear many times across all sets. The theorem guarantees that if each element appears at most $t$ times, then the elements can be colored so that the imbalance is at most $2t - 1$. Beck and Fiala conjectured that the imbalance can be even bounded by $O(\\sqrt t)$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "QP2H2XRMPK"
    ],
    "kind": "statement",
    "name": "Beck–Fiala theorem",
    "role": "proposition",
    "same_as": {
      "wikidata": "Q17002928",
      "wikipedia": "Beck–Fiala theorem"
    },
    "sources": [
      {
        "locator": "Beck–Fiala theorem",
        "mention": "wikipedia://en/39400139",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:39400139@r1285173572"
      }
    ],
    "tag": "R72C36E7M0"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/R72C36E7M0/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/R72C36E7M0.md",
  "msc": null,
  "name": "Beck–Fiala theorem",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/R72/R72C36E7M0.md",
  "status": null,
  "tag": "R72C36E7M0",
  "uri": "m2://R72C36E7M0",
  "url": "https://math2.tamnd.com/wiki/beck-fiala-theorem/",
  "writing": {
    "tag": "R72C36E7M0",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}