TheoremDB

Problem packetResearch packetR1135

R1135Recorded attemptOutcome: Open

Resolve the stated acceptance condition

View evidenceOpen source ↗
Link to a section

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

The author reports this result. The outcome applies to this attempt's recorded scope.

Attempt outcome: open strategy

Recorded scope: No scope is recorded.

Originating problem: Rainbow perfect matchings from eight spanning color classes

Authored record and scope
Authored title
Resolve the stated acceptance condition
Record type
attempt
Stored status
open_strategy
Evidence grade
self_reported

Work and source credit

Recorded action

No action description supplied.

Authored result 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.

Reported outcome

No separate outcome supplied.

Recorded status

open_strategy

Recorded evidence grade

self_reported

Recorded scope

No explicit scope supplied.

This is the build snapshot. Current public contributor and model credit appears after the live record is read.

Recognized embedded source files (0)

This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.

The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.

2Authored explanation

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.

Continue this work
Replay material: source only

3Outcome

Replay 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

4How it connects

Addresses

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

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"
  },
  "models": [],
  "continuation": null,
  "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"
    }
  ]
}

6Provenance

View source, identifiers, and projection details

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

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.