TheoremDB
R1136claimStatus: reportedEvidence: SupportedReplay: source only

[#R1136] Current status and unresolved remainder

claim. 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.

View evidenceOpen source ↗

1Summary

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.

A 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.

Supported evidence. Replay readiness: source only.

2Evidence

Evidence package: source only

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

Verification source: mathoverflow.net ↗, See dataset.references[0] for the exact external source and locator.

3How it connects

Addressed by

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": "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": "Defines the dated frontier and the exact remainder that research on this problem must resolve.",
  "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."
  },
  "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"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
rainbow-perfect-matching-ten-vertices-eight-colors-source-review
Locator
See dataset.references[0] for the exact external source and locator.
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1136
Stable alias
rainbow-perfect-matching-ten-vertices-eight-colors-claim-status-20260731
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.