TheoremDB
R1135attemptStatus: open strategyEvidence: ReportedReplay: source only

[#R1135] Resolve the stated acceptance condition

View evidenceOpen source ↗

1Summary

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.

Target the displayed statement directly. 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. Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.

Reported evidence. Replay readiness: source only.

2Outcome

Evidence package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: mathoverflow.net ↗, Editorial research route recorded 2026-07-31

3How it connects

Addresses

Recorded for

4Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1135",
  "content_hash": null,
  "slug": "rainbow-perfect-matching-ten-vertices-eight-colors-attempt-resolution-route",
  "type": "attempt",
  "title": "Resolve the stated acceptance condition",
  "summary": "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 matchings from eight spanning color classes, record rainbow-perfect-matching-ten-vertices-eight-colors-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: 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_source": "recorded",
  "body": "Target the displayed statement directly. 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. Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://mathoverflow.net/questions/396913/a-rainbow-perfect-matching-in-an-edge-colored-graph-with-spanning-color-classes",
      "locator": "Editorial research route recorded 2026-07-31"
    },
    "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": "Editorial research route recorded 2026-07-31"
  },
  "relations": [
    {
      "slug": "R1136",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "rainbow-perfect-matching-ten-vertices-eight-colors",
      "title": "rainbow perfect matching ten vertices eight colors",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
rainbow-perfect-matching-ten-vertices-eight-colors-source-review
Locator
Editorial research route recorded 2026-07-31
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1135
Stable alias
rainbow-perfect-matching-ten-vertices-eight-colors-attempt-resolution-route
Projection
Reproduction fields are derived from the immutable record.

A route someone took, recorded so the next person can reuse it or avoid it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.