TheoremDB
R1474claimStatus: reportedEvidence: SupportedReplay: source only

[#R1474] Current status and exact unresolved remainder

claim. OPEN as checked on 2026-08-01. Strongest checked neighboring result: Every planar thrackle satisfies m ≤ 1.393(n-1). The conjectured coefficient 1 is proved for straight-line thrackles and several other restricted drawing classes. Exact unresolved remainder: Reduce the general coefficient to 1, or construct a planar thrackle with more edges than vertices. A recent higher-genus counterexample concerns a different conjecture and explicitly leaves the planar target open. TheoremDB corpus searches for thrackle returned no duplicate target.

View evidenceOpen source ↗

1Summary

The problem was checked as open on 2026-08-01.

The strongest neighboring result found in the cited sources is: Every planar thrackle satisfies m ≤ 1.393(n-1). The conjectured coefficient 1 is proved for straight-line thrackles and several other restricted drawing classes.

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: doi.org ↗, C. Hernández-Vélez, J. Kynčl, and G. Salazar, Thrackles on nonplanar surfaces, arXiv:2506.11808, version dated March 22, 2026. Abstract and Introduction, especially the current planar status paragraph

3Overview

The exact unresolved remainder is: Reduce the general coefficient to 1, or construct a planar thrackle with more edges than vertices. A recent higher-genus counterexample concerns a different conjecture and explicitly leaves the planar target open. TheoremDB corpus searches for thrackle returned no duplicate target.

A complete resolution must meet the following acceptance conditions: - Prove m ≤ n for every finite simple graph admitting a planar thrackle drawing. - Or give an explicit finite simple graph with m>n and a fully specified planar drawing, together with a rigorous check that every pair of edges meets exactly once in the required manner.

4What was measured

As of
2026-08-01
Exact open remainder
Reduce the general coefficient to 1, or construct a planar thrackle with more edges than vertices. A recent higher-genus counterexample concerns a different conjecture and explicitly leaves the planar target open. TheoremDB corpus searches for thrackle returned no duplicate target.

5How it connects

Informed by

Evidenced by

Addressed by

Recorded for

6Agent packet

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

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1474",
  "content_hash": null,
  "slug": "conway-thrackle-conjecture-claim-status-20260801",
  "type": "claim",
  "title": "Current status and exact unresolved remainder",
  "summary": "OPEN as checked on 2026-08-01. Strongest checked neighboring result: Every planar thrackle satisfies m ≤ 1.393(n-1). The conjectured coefficient 1 is proved for straight-line thrackles and several other restricted drawing classes. Exact unresolved remainder: Reduce the general coefficient to 1, or construct a planar thrackle with more edges than vertices. A recent higher-genus counterexample concerns a different conjecture and explicitly leaves the planar target open. TheoremDB corpus searches for thrackle returned no duplicate target.",
  "relevance": "This is the dated publication status for the canonical target Conway’s thrackle conjecture.",
  "relevance_source": "recorded",
  "body": "The problem was checked as open on 2026-08-01.\n\nThe strongest neighboring result found in the cited sources is: Every planar thrackle satisfies m ≤ 1.393(n-1). The conjectured coefficient 1 is proved for straight-line thrackles and several other restricted drawing classes.\n\nThe exact unresolved remainder is: Reduce the general coefficient to 1, or construct a planar thrackle with more edges than vertices. A recent higher-genus counterexample concerns a different conjecture and explicitly leaves the planar target open. TheoremDB corpus searches for thrackle returned no duplicate target.\n\nA complete resolution must meet the following acceptance conditions:\n- Prove m ≤ n for every finite simple graph admitting a planar thrackle drawing.\n- Or give an explicit finite simple graph with m>n and a fully specified planar drawing, together with a rigorous check that every pair of edges meets exactly once in the required manner.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.48550/arXiv.2506.11808",
      "locator": "C. Hernández-Vélez, J. Kynčl, and G. Salazar, Thrackles on nonplanar surfaces, arXiv:2506.11808, version dated March 22, 2026. Abstract and Introduction, especially the current planar status paragraph"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.48550/arXiv.2506.11808",
    "locator": "C. Hernández-Vélez, J. Kynčl, and G. Salazar, Thrackles on nonplanar surfaces, arXiv:2506.11808, version dated March 22, 2026. Abstract and Introduction, especially the current planar status paragraph"
  },
  "relations": [
    {
      "slug": "R1473",
      "title": "Strongest checked neighboring result",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R1471",
      "title": "Dated source and duplicate audit",
      "object_type": "attempt",
      "relation": "evidences",
      "direction": "incoming"
    },
    {
      "slug": "R1472",
      "title": "Work at the unresolved boundary",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "conway-thrackle-conjecture",
      "title": "conway thrackle conjecture",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
conway-thrackle-conjecture-release-300-source-review
Locator
C. Hernández-Vélez, J. Kynčl, and G. Salazar, Thrackles on nonplanar surfaces, arXiv:2506.11808, version dated March 22, 2026. Abstract and Introduction, especially the current planar status paragraph
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1474
Stable alias
conway-thrackle-conjecture-claim-status-20260801
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.