{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1136",
  "content_hash": null,
  "slug": "rainbow-perfect-matching-ten-vertices-eight-colors-claim-status-20260731",
  "type": "claim",
  "title": "Current status and unresolved remainder",
  "summary": "UNKNOWN as of 2026-07-31. The MathOverflow page has zero answers. Neugebauer's 2022 thesis explicitly leaves the associated value k(10) equal to either 1 or 2, which is exactly the decision posed here. Exact-title and parameter searches through 2026 found no later resolution. Prove that every graph and coloring satisfying the displayed hypotheses has a rainbow perfect matching, or give one explicit ten-vertex colored graph satisfying every spanning-color condition and having no rainbow perfect matching.",
  "relevance": "For rainbow perfect matching ten vertices eight colors, pins the dated research frontier: UNKNOWN as of 2026-07-31. The MathOverflow page has zero answers. Neugebauer's 2022 thesis explicitly leaves the associated value k(10) equal to either 1 or 2, which is exactly the decision posed here. Exact-title and parameter searches through 2026 found no later resolution. Prove that every graph.",
  "relevance_source": "recorded",
  "body": "UNKNOWN as of 2026-07-31. The MathOverflow page has zero answers. Neugebauer's 2022 thesis explicitly leaves the associated value k(10) equal to either 1 or 2, which is exactly the decision posed here. Exact-title and parameter searches through 2026 found no later resolution.\n\nA complete resolution must satisfy this condition: Prove that every graph and coloring satisfying the displayed hypotheses has a rainbow perfect matching, or give one explicit ten-vertex colored graph satisfying every spanning-color condition and having no rainbow perfect matching.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://mathoverflow.net/questions/396913/a-rainbow-perfect-matching-in-an-edge-colored-graph-with-spanning-color-classes",
      "locator": "See dataset.references[0] for the exact external source and locator."
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://mathoverflow.net/questions/396913/a-rainbow-perfect-matching-in-an-edge-colored-graph-with-spanning-color-classes",
    "locator": "See dataset.references[0] for the exact external source and locator."
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1135",
      "title": "Resolve the stated acceptance condition",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "rainbow-perfect-matching-ten-vertices-eight-colors",
      "title": "rainbow perfect matching ten vertices eight colors",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}