{
  "ramsey": {
    "name": "Ramsey numbers",
    "description": "The Ramsey number $R(r,s)$ is the smallest number $n$ such that any two-coloring of the edges of the complete graph $K_n$ must contain either a monochromatic $K_r$ in the first color or a monochromatic $K_s$ in the second color.",
    "external_ids": {
      "mathworld": "RamseyNumber",
      "metamath": "df-ram",
      "msc": "05D10",
      "planetmath": "RamseyNumbers",
      "wikidata": "Q16424100",
      "wikipedia_en": "Ramsey_number"
    },
    "display_type": "grid",
    "id_template": "ramsey-{r}-{s}",
    "name_template": "Ramsey number $R({r},{s})$",
    "description_template": "The smallest number $n$ such that any two-coloring of the edges of the complete graph $K_n$ must contain either a monochromatic $K_{{{r}}}$ in the first color or a monochromatic $K_{{{s}}}$ in the second color.",
    "parameters": [
      "r",
      "s"
    ],
    "added_by": "daniel-munro",
    "category": "05D Extremal combinatorics",
    "certifiable": true,
    "stats": {
      "total_constants": 76,
      "exact_values": 9,
      "bounded": 67,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 152,
      "verified_bounds": 57,
      "attested_bounds": 1,
      "source_bounds": 94,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-11"
    }
  },
  "square-packing": {
    "name": "Packing unit squares in a square",
    "description": "$s(n)$ is the side of the smallest square into which $n$ unit squares can be packed.",
    "external_ids": {
      "mathworld": "SquarePacking",
      "msc": "52C15",
      "wikidata": "Q7582076",
      "wikipedia_en": "Square_packing"
    },
    "display_type": "sequence",
    "id_template": "square-packing-in-square-{n}",
    "name_template": "Packing unit squares in a square $s({n})$",
    "description_template": "The side of the smallest square into which ${n}$ unit squares can be packed.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 100,
      "exact_values": 35,
      "bounded": 65,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 200,
      "verified_bounds": 109,
      "attested_bounds": 0,
      "source_bounds": 91,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-09"
    }
  },
  "busy-beaver-shift": {
    "name": "Busy beaver shift function",
    "description": "The busy beaver shift function $BB(n)$, also written $S(n)$, is the maximum number of steps made by an $n$-state, 2-symbol Turing machine that halts when started on a blank tape.",
    "external_ids": {
      "mathworld": "BusyBeaver",
      "msc": "03D10",
      "wikidata": "Q1427965",
      "wikipedia_en": "Busy_beaver",
      "oeis": "A060843"
    },
    "display_type": "sequence",
    "id_template": "busy-beaver-shift-{n}",
    "name_template": "Busy beaver shift function $BB({n})$",
    "description_template": "The maximum number of steps made by a ${n}$-state, 2-symbol Turing machine that halts when started on a blank tape.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "03D Computability and recursion theory",
    "certifiable": true,
    "stats": {
      "total_constants": 7,
      "exact_values": 5,
      "bounded": 0,
      "half_bounded": 2,
      "unbounded": 0,
      "current_bounds": 12,
      "verified_bounds": 5,
      "attested_bounds": 0,
      "source_bounds": 5,
      "via_bounds": 2,
      "unsourced_bounds": 0,
      "last_improvement": "2025-06-25"
    }
  },
  "busy-beaver-ones": {
    "name": "Busy beaver ones function",
    "description": "The busy beaver ones function $\\Sigma(n)$ (Rad\u00f3's sigma function) is the maximum number of 1s left on the tape by an $n$-state, 2-symbol Turing machine that halts when started on a blank tape.",
    "external_ids": {
      "mathworld": "BusyBeaver",
      "msc": "03D10",
      "wikidata": "Q1427965",
      "wikipedia_en": "Busy_beaver",
      "oeis": "A028444"
    },
    "display_type": "sequence",
    "id_template": "busy-beaver-ones-{n}",
    "name_template": "Busy beaver ones function $\\Sigma({n})$",
    "description_template": "The maximum number of 1s left on the tape by a ${n}$-state, 2-symbol Turing machine that halts when started on a blank tape.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "03D Computability and recursion theory",
    "certifiable": true,
    "stats": {
      "total_constants": 7,
      "exact_values": 5,
      "bounded": 0,
      "half_bounded": 2,
      "unbounded": 0,
      "current_bounds": 12,
      "verified_bounds": 5,
      "attested_bounds": 0,
      "source_bounds": 5,
      "via_bounds": 2,
      "unsourced_bounds": 0,
      "last_improvement": "2025-06-25"
    }
  },
  "kissing-number": {
    "name": "Kissing numbers",
    "description": "The kissing number of $\\mathbb{R}^n$ is the maximum number of non-overlapping unit spheres that can touch a central unit sphere in $\\mathbb{R}^n$.",
    "external_ids": {
      "mathworld": "KissingNumber",
      "msc": "52C17",
      "wikidata": "Q1371530",
      "wikipedia_en": "Kissing_number"
    },
    "display_type": "sequence",
    "id_template": "kissing-number-{n}",
    "name_template": "Kissing number for $\\mathbb{{R}}^{{{n}}}$",
    "description_template": "The maximum number of non-overlapping unit spheres that can touch a central unit sphere in $\\mathbb{{R}}^{{{n}}}$.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 24,
      "exact_values": 6,
      "bounded": 18,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 48,
      "verified_bounds": 14,
      "attested_bounds": 0,
      "source_bounds": 34,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-14"
    }
  },
  "degree-diameter": {
    "name": "Degree-diameter problem",
    "description": "$N(d,k)$ is the largest possible number of vertices in a graph of maximum degree $d$ and diameter at most $k$.",
    "external_ids": {
      "mathworld": "Degree-DiameterProblem",
      "msc": "05C35",
      "wikidata": "Q5251835",
      "wikipedia_en": "Degree_diameter_problem"
    },
    "display_type": "grid",
    "id_template": "degree-diameter-{d}-{k}",
    "name_template": "Degree-diameter problem $N({d},{k})$",
    "description_template": "The largest possible number of vertices in a graph of maximum degree ${d}$ and diameter at most ${k}$.",
    "parameters": [
      "d",
      "k"
    ],
    "added_by": "daniel-munro",
    "category": "05C Graph theory",
    "certifiable": true,
    "stats": {
      "total_constants": 162,
      "exact_values": 7,
      "bounded": 155,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 324,
      "verified_bounds": 59,
      "attested_bounds": 0,
      "source_bounds": 265,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-16"
    }
  },
  "cage": {
    "name": "Cages",
    "description": "$n(k,g)$ is the order of a $(k,g)$-cage, a $k$-regular graph of girth $g$ with the fewest possible vertices.",
    "external_ids": {
      "mathworld": "CageGraph",
      "msc": "05C35",
      "wikipedia_en": "Cage_(graph_theory)"
    },
    "display_type": "grid",
    "id_template": "cage-{k}-{g}",
    "name_template": "Cage order $n({k},{g})$",
    "description_template": "The order of a $({k},{g})$-cage, a ${k}$-regular graph of girth ${g}$ with the fewest possible vertices.",
    "parameters": [
      "k",
      "g"
    ],
    "added_by": "daniel-munro",
    "category": "05C Graph theory",
    "certifiable": true,
    "stats": {
      "total_constants": 252,
      "exact_values": 83,
      "bounded": 169,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 504,
      "verified_bounds": 163,
      "attested_bounds": 0,
      "source_bounds": 266,
      "via_bounds": 75,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-11"
    }
  },
  "debruijn-newman": {
    "name": "de Bruijn\u2013Newman constant",
    "description": "The de Bruijn\u2013Newman constant $\\Lambda$ is defined via the zeros of a certain function $H(\\lambda,z)$, where $\\lambda$ is a real parameter and $z$ is a complex variable. More precisely, $H(\\lambda, z):=\\int_{0}^{\\infty} e^{\\lambda u^{2}} \\Phi(u) \\cos (z u) \\, du$, where $\\Phi$ is the super-exponentially decaying function $\\Phi(u) = \\sum_{n=1}^{\\infty} (2\\pi^2n^4e^{9u}-3\\pi n^2 e^{5u} ) e^{-\\pi n^2 e^{4u}}$ and $\\Lambda$ is the unique real number with the property that $H(\\lambda, \\cdot)$ has only real zeros if and only if $\\lambda\\geq \\Lambda$. The Riemann hypothesis is equivalent to $\\Lambda \\le 0$.",
    "external_ids": {
      "mathworld": "deBruijn-NewmanConstant",
      "msc": "11M26",
      "wikidata": "Q2248459",
      "wikipedia_en": "De_Bruijn\u2013Newman_constant"
    },
    "display_type": "single",
    "parameters": [],
    "added_by": "daniel-munro",
    "category": "11M Zeta and L-functions: analytic theory",
    "certifiable": true,
    "stats": {
      "total_constants": 1,
      "exact_values": 0,
      "bounded": 1,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 2,
      "verified_bounds": 0,
      "attested_bounds": 0,
      "source_bounds": 2,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2021-01-22"
    }
  },
  "van-der-waerden": {
    "name": "Van der Waerden numbers",
    "description": "$W(r,k)$ is the smallest number $n$ such that if the integers $1$ to $n$ are colored with $r$ colors, there must be a monochromatic arithmetic progression of length $k$.",
    "external_ids": {
      "mathworld": "vanderWaerdenNumber",
      "msc": "05D10",
      "wikidata": "Q7913892",
      "wikipedia_en": "Van_der_Waerden_number"
    },
    "display_type": "grid",
    "id_template": "van-der-waerden-{r}-{k}",
    "name_template": "Van der Waerden number $W({r},{k})$",
    "description_template": "The smallest number $n$ such that if the integers $1$ to $n$ are colored with ${r}$ colors, there must be a monochromatic arithmetic progression of length ${k}$.",
    "parameters": [
      "r",
      "k"
    ],
    "added_by": "daniel-munro",
    "category": "05D Extremal combinatorics",
    "certifiable": true,
    "stats": {
      "total_constants": 45,
      "exact_values": 7,
      "bounded": 38,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 90,
      "verified_bounds": 24,
      "attested_bounds": 0,
      "source_bounds": 66,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2022-11-20"
    }
  },
  "stamp-folding": {
    "name": "Stamp folding",
    "description": "$s(n)$ is the number of ways to fold a strip of $n$ stamps, hinged where they meet, into a pile one stamp in size, counted by the order of the stamps in the pile.",
    "external_ids": {
      "mathworld": "StampFolding",
      "wikidata": "Q6753749",
      "wikipedia_en": "Map_folding",
      "oeis": "A000136"
    },
    "display_type": "sequence",
    "id_template": "stamp-folding-{n}",
    "name_template": "Stamp folding $s({n})$",
    "description_template": "The number of ways to fold a strip of ${n}$ stamps into a pile one stamp in size, counted by the order of the stamps in the pile.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "05A Enumerative combinatorics",
    "certifiable": true,
    "stats": {
      "total_constants": 29,
      "exact_values": 29,
      "bounded": 0,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 58,
      "verified_bounds": 16,
      "attested_bounds": 0,
      "source_bounds": 0,
      "via_bounds": 42,
      "unsourced_bounds": 0,
      "last_improvement": null
    }
  },
  "map-folding": {
    "name": "Map folding",
    "description": "The number of ways to fold an $m \\times n$ map, creased along the lines of its grid of unit squares, into a pile one square in size, counted by the order of the squares in the pile.",
    "external_ids": {
      "mathworld": "MapFolding",
      "wikidata": "Q6753749",
      "wikipedia_en": "Map_folding",
      "oeis": "A001418"
    },
    "display_type": "grid",
    "id_template": "map-folding-{m}-{n}",
    "name_template": "Map folding $({m} \\times {n})$",
    "description_template": "The number of ways to fold a ${m} \\times {n}$ map along its creases into a pile one square in size, counted by the order of the squares in the pile.",
    "parameters": [
      "m",
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "05A Enumerative combinatorics",
    "certifiable": true,
    "stats": {
      "total_constants": 87,
      "exact_values": 42,
      "bounded": 45,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 174,
      "verified_bounds": 79,
      "attested_bounds": 0,
      "source_bounds": 60,
      "via_bounds": 35,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-16"
    }
  },
  "disk-covering": {
    "name": "Covering a disk with disks",
    "description": "$r(n)$ is the smallest radius such that $n$ disks of that radius can cover the unit disk, of radius 1.",
    "external_ids": {
      "mathworld": "DiskCoveringProblem",
      "msc": "52C15",
      "wikipedia_en": "Disk_covering_problem"
    },
    "display_type": "sequence",
    "id_template": "disk-covering-{n}",
    "name_template": "Covering a disk with ${n}$ disks",
    "description_template": "The smallest radius such that ${n}$ disks of that radius can cover the unit disk, of radius 1.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 25,
      "exact_values": 20,
      "bounded": 5,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 50,
      "verified_bounds": 12,
      "attested_bounds": 0,
      "source_bounds": 38,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-16"
    }
  },
  "circle-in-equilateral": {
    "name": "Circle packing in an equilateral triangle",
    "description": "The side length of the smallest equilateral triangle into which $n$ unit circles (of radius 1) can be packed.",
    "external_ids": {
      "msc": "52C15",
      "wikipedia_en": "Circle_packing_in_an_equilateral_triangle"
    },
    "display_type": "sequence",
    "id_template": "circle-in-equilateral-{n}",
    "name_template": "Packing ${n}$ unit circles in an equilateral triangle",
    "description_template": "The side length of the smallest equilateral triangle into which ${n}$ unit circles (of radius 1) can be packed.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 15,
      "exact_values": 15,
      "bounded": 0,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 30,
      "verified_bounds": 22,
      "attested_bounds": 0,
      "source_bounds": 8,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2020-09-02"
    }
  },
  "circle-in-square": {
    "name": "Circle packing in a square",
    "description": "$s(n)$ is the side of the smallest square into which $n$ unit circles (of radius 1) can be packed. Equivalently, $s(n) = 2 + 2/d_n$, where $d_n$ is the largest possible minimum distance between $n$ points in a unit square.",
    "external_ids": {
      "msc": "52C15",
      "wikipedia_en": "Circle_packing_in_a_square"
    },
    "display_type": "sequence",
    "id_template": "circle-in-square-{n}",
    "name_template": "Packing ${n}$ unit circles in a square",
    "description_template": "The side of the smallest square into which ${n}$ unit circles (of radius 1) can be packed.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 36,
      "exact_values": 34,
      "bounded": 2,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 72,
      "verified_bounds": 30,
      "attested_bounds": 0,
      "source_bounds": 40,
      "via_bounds": 2,
      "unsourced_bounds": 0,
      "last_improvement": "2021-09-29"
    }
  },
  "minimal-superpermutation": {
    "name": "Minimal superpermutations",
    "description": "$L(n)$ is the length of the shortest string that contains each permutation of $n$ symbols as a contiguous substring.",
    "external_ids": {
      "msc": "05A05",
      "oeis": "A180632",
      "wikidata": "Q17048413",
      "wikipedia_en": "Superpermutation"
    },
    "display_type": "sequence",
    "id_template": "minimal-superpermutation-{n}",
    "name_template": "Minimal superpermutation length $L({n})$",
    "description_template": "The length of the shortest string that contains each permutation of ${n}$ symbols as a contiguous substring.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "05A Enumerative combinatorics",
    "certifiable": true,
    "stats": {
      "total_constants": 9,
      "exact_values": 5,
      "bounded": 4,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 18,
      "verified_bounds": 10,
      "attested_bounds": 0,
      "source_bounds": 6,
      "via_bounds": 2,
      "unsourced_bounds": 0,
      "last_improvement": "2026-10-22"
    }
  },
  "affine-line-arrangements": {
    "name": "Arrangements of lines in the affine plane",
    "description": "The number of combinatorially different arrangements of $n$ lines in the plane, where lines may be parallel and more than two may meet at a point. Two arrangements are the same if a homeomorphism of the plane, which may reverse its orientation, takes the lines of one to the lines of the other.",
    "external_ids": {
      "oeis": "A241600"
    },
    "display_type": "sequence",
    "id_template": "affine-line-arrangements-{n}",
    "name_template": "Arrangements of ${n}$ lines in the affine plane",
    "description_template": "The number of combinatorially different arrangements of ${n}$ lines in the plane, which may be parallel or meet more than two at a point.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 12,
      "exact_values": 7,
      "bounded": 5,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 24,
      "verified_bounds": 11,
      "attested_bounds": 0,
      "source_bounds": 9,
      "via_bounds": 4,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-16"
    }
  },
  "affine-line-arrangements-general-position": {
    "name": "Arrangements of lines in general position",
    "description": "The number of combinatorially different arrangements of $n$ lines in general position in the plane: no two parallel and no three through a point. Two arrangements are the same if a homeomorphism of the plane, which may reverse its orientation, takes the lines of one to the lines of the other.",
    "external_ids": {
      "oeis": "A090338"
    },
    "display_type": "sequence",
    "id_template": "affine-line-arrangements-general-position-{n}",
    "name_template": "Arrangements of ${n}$ lines in general position",
    "description_template": "The number of combinatorially different arrangements of ${n}$ lines in the plane with no two parallel and no three through a point.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 12,
      "exact_values": 9,
      "bounded": 3,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 24,
      "verified_bounds": 10,
      "attested_bounds": 0,
      "source_bounds": 8,
      "via_bounds": 6,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-11"
    }
  },
  "golomb-ruler": {
    "name": "Optimal Golomb rulers",
    "description": "A Golomb ruler is a set of integer marks such that no two pairs of marks are the same distance apart. $G(n)$ is the shortest length of a Golomb ruler with $n$ marks.",
    "external_ids": {
      "mathworld": "GolombRuler",
      "msc": "05B10",
      "oeis": "A003022",
      "wikipedia_en": "Golomb_ruler"
    },
    "display_type": "sequence",
    "id_template": "golomb-ruler-{n}",
    "name_template": "Optimal Golomb ruler $G({n})$",
    "description_template": "The shortest length of a Golomb ruler with ${n}$ marks: a set of ${n}$ integers such that no two pairs of them are the same distance apart.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "05B Designs and configurations",
    "certifiable": true,
    "stats": {
      "total_constants": 30,
      "exact_values": 28,
      "bounded": 2,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 60,
      "verified_bounds": 36,
      "attested_bounds": 0,
      "source_bounds": 24,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-15"
    }
  },
  "schur": {
    "name": "Schur numbers",
    "description": "The Schur number $S(k)$ is the largest number $n$ such that the integers $1$ to $n$ can be colored with $k$ colors with no monochromatic solution to $x + y = z$.",
    "external_ids": {
      "mathworld": "SchurNumber",
      "msc": "05D10",
      "oeis": "A045652",
      "wikipedia_en": "Schur_number"
    },
    "display_type": "sequence",
    "id_template": "schur-{k}",
    "name_template": "Schur number $S({k})$",
    "description_template": "The largest number $n$ such that the integers $1$ to $n$ can be colored with ${k}$ colors with no monochromatic solution to $x + y = z$.",
    "parameters": [
      "k"
    ],
    "added_by": "daniel-munro",
    "category": "05D Extremal combinatorics",
    "certifiable": true,
    "stats": {
      "total_constants": 9,
      "exact_values": 5,
      "bounded": 4,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 18,
      "verified_bounds": 11,
      "attested_bounds": 0,
      "source_bounds": 7,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-04"
    }
  },
  "weak-schur": {
    "name": "Weak Schur numbers",
    "description": "The weak Schur number $WS(k)$ is the largest number $n$ such that the integers $1$ to $n$ can be colored with $k$ colors with no monochromatic solution to $x + y = z$ with $x \\neq y$.",
    "external_ids": {
      "oeis": "A072842"
    },
    "display_type": "sequence",
    "id_template": "weak-schur-{k}",
    "name_template": "Weak Schur number $WS({k})$",
    "description_template": "The largest number $n$ such that the integers $1$ to $n$ can be colored with ${k}$ colors with no monochromatic solution to $x + y = z$ with $x \\neq y$.",
    "parameters": [
      "k"
    ],
    "added_by": "daniel-munro",
    "category": "05D Extremal combinatorics",
    "certifiable": true,
    "stats": {
      "total_constants": 9,
      "exact_values": 4,
      "bounded": 5,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 18,
      "verified_bounds": 12,
      "attested_bounds": 0,
      "source_bounds": 6,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-08"
    }
  },
  "snake-in-the-box": {
    "name": "Snake-in-the-box",
    "description": "A snake in the $n$-dimensional hypercube is an induced path: a path whose vertices are adjacent only when they're consecutive on the path. $s(n)$ is the length, in edges, of the longest snake in the $n$-dimensional hypercube.",
    "external_ids": {
      "msc": "05C38",
      "oeis": "A099155",
      "wikipedia_en": "Snake-in-the-box"
    },
    "display_type": "sequence",
    "id_template": "snake-in-the-box-{n}",
    "name_template": "Snake-in-the-box $s({n})$",
    "description_template": "The length, in edges, of the longest induced path in the ${n}$-dimensional hypercube.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "05C Graph theory",
    "certifiable": true,
    "stats": {
      "total_constants": 13,
      "exact_values": 8,
      "bounded": 5,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 26,
      "verified_bounds": 19,
      "attested_bounds": 0,
      "source_bounds": 7,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-11"
    }
  },
  "coil-in-the-box": {
    "name": "Coil-in-the-box",
    "description": "A coil in the $n$-dimensional hypercube is an induced cycle: a cycle whose vertices are adjacent only when they're consecutive around the cycle. $c(n)$ is the length, in edges, of the longest coil in the $n$-dimensional hypercube.",
    "external_ids": {
      "msc": "05C38",
      "oeis": "A000937"
    },
    "display_type": "sequence",
    "id_template": "coil-in-the-box-{n}",
    "name_template": "Coil-in-the-box $c({n})$",
    "description_template": "The length, in edges, of the longest induced cycle in the ${n}$-dimensional hypercube.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "05C Graph theory",
    "certifiable": true,
    "stats": {
      "total_constants": 12,
      "exact_values": 7,
      "bounded": 5,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 24,
      "verified_bounds": 13,
      "attested_bounds": 0,
      "source_bounds": 11,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-08-29"
    }
  },
  "cap-set": {
    "name": "Cap sets",
    "description": "A cap set is a set of points in the $n$-dimensional affine space $\\mathbb{F}_3^n$ with no three on a line, or equivalently no three distinct points $x, y, z$ with $x + y + z = 0$. In the card game SET, it's a collection of cards with no set among them. $r(n)$ is the size of the largest cap set in $\\mathbb{F}_3^n$.",
    "external_ids": {
      "msc": "51E22",
      "oeis": "A090245",
      "wikidata": "Q28455422",
      "wikipedia_en": "Cap_set"
    },
    "display_type": "sequence",
    "id_template": "cap-set-{n}",
    "name_template": "Cap set $r({n})$",
    "description_template": "The size of the largest set of points in $\\mathbb{{F}}_3^{{{n}}}$ with no three on a line.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "51E Finite geometry and special incidence structures",
    "certifiable": true,
    "stats": {
      "total_constants": 8,
      "exact_values": 6,
      "bounded": 2,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 16,
      "verified_bounds": 9,
      "attested_bounds": 0,
      "source_bounds": 7,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2023-12-14"
    }
  },
  "no-three-in-line": {
    "name": "No-three-in-line problem",
    "description": "$D(n)$ is the largest number of points of the $n \\times n$ grid that can be chosen with no three on a line, in any direction. Since each row holds at most two of them, $D(n) \\le 2n$. It's conjectured that $D(n) < 2n$ for all large $n$.",
    "external_ids": {
      "mathworld": "No-Three-in-a-LineProblem",
      "msc": "52C10",
      "oeis": "A272651",
      "wikidata": "Q6580594",
      "wikipedia_en": "No-three-in-line_problem"
    },
    "display_type": "sequence",
    "id_template": "no-three-in-line-{n}",
    "name_template": "No-three-in-line $D({n})$",
    "description_template": "The largest number of points of the ${n} \\times {n}$ grid with no three on a line.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 78,
      "exact_values": 76,
      "bounded": 2,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 156,
      "verified_bounds": 156,
      "attested_bounds": 0,
      "source_bounds": 0,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-05"
    }
  },
  "isosceles-set": {
    "name": "Isosceles sets",
    "description": "An isosceles set is a set of points in which every three points form an isosceles triangle. $i(n)$ is the size of the largest isosceles set in the $n$-dimensional Euclidean space $\\mathbb{R}^n$. Erd\u0151s asked for $i(3)$ in 1946.",
    "external_ids": {
      "msc": "52C10",
      "oeis": "A175769",
      "wikidata": "Q55614672"
    },
    "display_type": "sequence",
    "id_template": "isosceles-set-{n}",
    "name_template": "Isosceles set $i({n})$",
    "description_template": "The size of the largest set of points in $\\mathbb{{R}}^{{{n}}}$ in which every three points form an isosceles triangle.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 12,
      "exact_values": 12,
      "bounded": 0,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 24,
      "verified_bounds": 12,
      "attested_bounds": 0,
      "source_bounds": 12,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-02"
    }
  },
  "sorting-network-size": {
    "name": "Smallest sorting networks",
    "description": "A sorting network on $n$ inputs is a sequence of comparators, each of which joins two of $n$ wires and puts the smaller of their two values on the first wire and the larger on the second, that sorts every input. $S(n)$ is the smallest number of comparators in a sorting network on $n$ inputs.",
    "external_ids": {
      "msc": "68P10",
      "oeis": "A003075",
      "wikipedia_en": "Sorting_network"
    },
    "display_type": "sequence",
    "id_template": "sorting-network-size-{n}",
    "name_template": "Smallest sorting network $S({n})$",
    "description_template": "The smallest number of comparators in a sorting network on ${n}$ inputs.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "68P Theory of data",
    "certifiable": true,
    "stats": {
      "total_constants": 32,
      "exact_values": 12,
      "bounded": 20,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 64,
      "verified_bounds": 34,
      "attested_bounds": 0,
      "source_bounds": 30,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-10-19"
    }
  },
  "sorting-network-depth": {
    "name": "Fastest sorting networks",
    "description": "A sorting network on $n$ inputs is a sequence of comparators, each of which joins two of $n$ wires and puts the smaller of their two values on the first wire and the larger on the second, that sorts every input. Comparators on different wires can act at the same time, so a network acts in steps, or layers, of comparators on disjoint wires. $D(n)$ is the smallest number of steps, or depth, of a sorting network on $n$ inputs.",
    "external_ids": {
      "msc": "68P10",
      "oeis": "A067782",
      "wikipedia_en": "Sorting_network"
    },
    "display_type": "sequence",
    "id_template": "sorting-network-depth-{n}",
    "name_template": "Fastest sorting network $D({n})$",
    "description_template": "The smallest depth, or number of parallel steps, of a sorting network on ${n}$ inputs.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "68P Theory of data",
    "certifiable": true,
    "stats": {
      "total_constants": 32,
      "exact_values": 17,
      "bounded": 15,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 64,
      "verified_bounds": 34,
      "attested_bounds": 0,
      "source_bounds": 30,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2025-11-06"
    }
  },
  "rectilinear-crossing": {
    "name": "Rectilinear crossing number of the complete graph",
    "description": "The rectilinear crossing number $\\overline{\\mathrm{cr}}(K_n)$ is the fewest crossings in a drawing of the complete graph $K_n$ in the plane with straight edges and no three vertices on a line. Two edges cross exactly when their four ends are in convex position, so it is also the fewest convex quadrilaterals spanned by $n$ points in general position.",
    "external_ids": {
      "mathworld": "RectilinearCrossingNumber",
      "msc": "52C10",
      "oeis": "A014540",
      "wikipedia_en": "Crossing_number_(graph_theory)"
    },
    "display_type": "sequence",
    "id_template": "rectilinear-crossing-{n}",
    "name_template": "Rectilinear crossing number $\\overline{{\\mathrm{{cr}}}}(K_{{{n}}})$",
    "description_template": "The fewest crossings in a drawing of the complete graph $K_{{{n}}}$ in the plane with straight edges and no three vertices on a line.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 96,
      "exact_values": 24,
      "bounded": 72,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 192,
      "verified_bounds": 25,
      "attested_bounds": 0,
      "source_bounds": 145,
      "via_bounds": 22,
      "unsourced_bounds": 0,
      "last_improvement": "2015-05-26"
    }
  },
  "multicolor-ramsey-triangle": {
    "name": "Multicolor Ramsey numbers for triangles",
    "description": "The multicolor Ramsey number $R_k(3) = R(3,3,\\ldots,3)$ is the smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with $k$ colors contains a monochromatic triangle. A coloring of $1, \\ldots, m$ with no monochromatic solution to $x + y = z$ colors the edges of $K_{m+1}$ with no monochromatic triangle, by coloring the edge $uv$ with the color of $\\lvert u - v \\rvert$, so $R_k(3) \\ge S(k) + 2$, where $S(k)$ is the Schur number.",
    "external_ids": {
      "msc": "05D10",
      "oeis": "A003323",
      "wikipedia_en": "Ramsey's_theorem"
    },
    "display_type": "sequence",
    "id_template": "multicolor-ramsey-triangle-{k}",
    "name_template": "Multicolor Ramsey number $R_{{{k}}}(3)$",
    "description_template": "The smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with ${k}$ colors contains a monochromatic triangle.",
    "parameters": [
      "k"
    ],
    "added_by": "daniel-munro",
    "category": "05D Extremal combinatorics",
    "certifiable": true,
    "stats": {
      "total_constants": 7,
      "exact_values": 1,
      "bounded": 6,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 14,
      "verified_bounds": 6,
      "attested_bounds": 0,
      "source_bounds": 8,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-11-13"
    }
  },
  "chromatic-number-space": {
    "name": "Chromatic number of Euclidean space",
    "description": "The chromatic number $\\chi(\\mathbb{R}^n)$ of $n$-dimensional Euclidean space is the fewest colors needed to color the points of $\\mathbb{R}^n$ so that no two points at distance exactly 1 have the same color. For the plane, finding it is the Hadwiger\u2013Nelson problem. By the de Bruijn\u2013Erd\u0151s theorem, it is the largest chromatic number of a finite unit-distance graph in $\\mathbb{R}^n$ (assuming the axiom of choice), so lower bounds come from such graphs that can't be colored with fewer colors, and upper bounds from colorings of the whole space, often by tiling it with cells of diameter just under 1.",
    "external_ids": {
      "mathworld": "Hadwiger-NelsonProblem",
      "msc": "52C10",
      "wikidata": "Q1383936",
      "wikipedia_en": "Hadwiger\u2013Nelson_problem"
    },
    "display_type": "sequence",
    "id_template": "chromatic-number-space-{n}",
    "name_template": "Chromatic number $\\chi(\\mathbb{{R}}^{{{n}}})$",
    "description_template": "The fewest colors needed to color the points of $\\mathbb{{R}}^{{{n}}}$ so that no two points at distance exactly 1 have the same color.",
    "parameters": [
      "n"
    ],
    "added_by": "daniel-munro",
    "category": "52C Discrete geometry",
    "certifiable": true,
    "stats": {
      "total_constants": 11,
      "exact_values": 0,
      "bounded": 11,
      "half_bounded": 0,
      "unbounded": 0,
      "current_bounds": 22,
      "verified_bounds": 0,
      "attested_bounds": 2,
      "source_bounds": 20,
      "via_bounds": 0,
      "unsourced_bounds": 0,
      "last_improvement": "2026-10-11"
    }
  }
}