TheoremDB

Problem packetWorkR1127

R1127attemptStatus: open strategyEvidence: ReportedReplay: source only

[#R1127] Resolve the stated acceptance condition

View evidenceOpen source ↗

1Summary

For each of the two graphs, give a crossing-free straight-line drawing attaining a claimed value and a proof that no drawing can use fewer lines.

Target the displayed statement directly. For each of the two graphs, give a crossing-free straight-line drawing attaining a claimed value and a proof that no drawing can use fewer lines. 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

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

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": "R1127",
  "content_hash": null,
  "slug": "platonic-graph-line-cover-numbers-attempt-resolution-route",
  "type": "attempt",
  "title": "Resolve the stated acceptance condition",
  "summary": "For each of the two graphs, give a crossing-free straight-line drawing attaining a claimed value and a proof that no drawing can use fewer lines.",
  "relevance": "For Line-cover numbers of the dodecahedral and icosahedral graphs, record platonic-graph-line-cover-numbers-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: For each of the two graphs, give a crossing-free straight-line drawing attaining a claimed value and a proof that no drawing can use fewer lines.",
  "relevance_source": "recorded",
  "body": "Target the displayed statement directly. For each of the two graphs, give a crossing-free straight-line drawing attaining a claimed value and a proof that no drawing can use fewer lines. 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/302928/straight-line-drawing-of-regular-polyhedra",
      "locator": "Editorial research route recorded 2026-07-31"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://mathoverflow.net/questions/302928/straight-line-drawing-of-regular-polyhedra",
    "locator": "Editorial research route recorded 2026-07-31"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1128",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "platonic-graph-line-cover-numbers",
      "title": "platonic graph line cover numbers",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
platonic-graph-line-cover-numbers-source-review
Locator
Editorial research route recorded 2026-07-31
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1127
Stable alias
platonic-graph-line-cover-numbers-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.