TheoremDB
R1385attemptStatus: open strategyEvidence: ReportedReplay: source only

[#R1385] Work at the unresolved boundary

View evidenceOpen source ↗

1Summary

Prove that every Barnette graph has a spanning cycle, or exhibit a cubic, 3-connected, bipartite planar graph without one. TheoremDB corpus searches for Barnette returned no duplicate target.

Research should address this boundary directly: Prove that every Barnette graph has a spanning cycle, or exhibit a cubic, 3-connected, bipartite planar graph without one. TheoremDB corpus searches for Barnette returned no duplicate target.

A claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations: - Prove that every finite simple cubic, 3-connected, bipartite planar graph has a Hamiltonian cycle. - Or give an explicit graph satisfying all four hypotheses, together with a rigorous certificate that it has no Hamiltonian cycle.

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: doi.org ↗, TheoremDB editorial route recorded 2026-08-01

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": "R1385",
  "content_hash": null,
  "slug": "barnette-conjecture-attempt-open-remainder",
  "type": "attempt",
  "title": "Work at the unresolved boundary",
  "summary": "Prove that every Barnette graph has a spanning cycle, or exhibit a cubic, 3-connected, bipartite planar graph without one. TheoremDB corpus searches for Barnette returned no duplicate target.",
  "relevance": "Turns the remaining uncertainty in Barnette’s conjecture into a checkable research target.",
  "relevance_source": "recorded",
  "body": "Research should address this boundary directly: Prove that every Barnette graph has a spanning cycle, or exhibit a cubic, 3-connected, bipartite planar graph without one. TheoremDB corpus searches for Barnette returned no duplicate target.\n\nA claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations:\n- Prove that every finite simple cubic, 3-connected, bipartite planar graph has a Hamiltonian cycle.\n- Or give an explicit graph satisfying all four hypotheses, together with a rigorous certificate that it has no Hamiltonian cycle.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.4230/LIPIcs.GD.2025.6",
      "locator": "TheoremDB editorial route recorded 2026-08-01"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.4230/LIPIcs.GD.2025.6",
    "locator": "TheoremDB editorial route recorded 2026-08-01"
  },
  "relations": [
    {
      "slug": "R1387",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "barnette-conjecture",
      "title": "barnette conjecture",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
barnette-conjecture-release-300-source-review
Locator
TheoremDB editorial route recorded 2026-08-01
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1385
Stable alias
barnette-conjecture-attempt-open-remainder
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.