{
  "id": "ramsey-3-10",
  "family": "ramsey",
  "kind": "record",
  "title": "Ramsey number R(3,10): a graph with no 3-clique and no 10-independent set",
  "params": {
    "s": 3,
    "t": 10
  },
  "record": "39",
  "record_meaning": "largest known witness graph: 39 vertices, so R(3,10) ≥ 40",
  "record_from": "listed: Radziszowski, Small Ramsey Numbers (dynamic survey DS1), read 2026-11-04",
  "exact": false,
  "source_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS1",
  "keeper": "Radziszowski's dynamic survey of small Ramsey numbers",
  "url": "/v1/science/math/problems/ramsey-3-10",
  "source": "Radziszowski, Small Ramsey Numbers (dynamic survey DS1)",
  "as_of": "2026-11-04",
  "how_to_submit": "construction: {n, edges: [[i, j], ...]} with vertices 0 to n-1, or {graph6: \"...\"}. The graph must have no s vertices all joined and no t vertices with no edges among them. Score = n, which proves R(s,t) ≥ n+1. Up to 160 vertices.",
  "example_construction": {
    "n": 5,
    "edges": [
      [
        0,
        1
      ],
      [
        1,
        2
      ],
      [
        2,
        3
      ],
      [
        3,
        4
      ],
      [
        4,
        0
      ]
    ]
  },
  "leaderboard": []
}