{
  "domain": "mathematics",
  "topics": [
    "graph-theory",
    "combinatorics"
  ],
  "type": "proof",
  "also": [
    "construction",
    "algorithm"
  ],
  "structure": "instances",
  "verify": [
    "certificate",
    "performance"
  ],
  "instances": [
    "R(5,5)",
    "R(4,6)",
    "R(3,10)",
    "R(6,6)"
  ],
  "metric": {
    "name": "lower bound",
    "better": "higher"
  },
  "cover": {
    "motif": "graph",
    "n": 6
  }
}