TheoremDB

Problem packetWorkR1389

R1389claimStatus: reportedEvidence: SupportedReplay: source only

[#R1389] Dated status and exact unresolved remainder

claim. Unresolved in this packet after the dated source check. Strongest checked result: The linked 2026 article records a consequence of Kardoš and collaborators: a 1-factor can meet any prescribed collection of pairwise edge-disjoint odd cycles in a bridgeless cubic graph. It treats the six-perfect-matching conjecture as open. Exact unresolved remainder: Construct six perfect matchings covering every edge exactly twice in every bridgeless cubic graph, or give a bridgeless cubic graph and prove that no such cover exists.

View evidenceOpen source ↗

1Summary

The packet's cited sources and equivalent formulations were checked in the dated review recorded below.

Strongest checked result: The linked 2026 article records a consequence of Kardoš and collaborators: a 1-factor can meet any prescribed collection of pairwise edge-disjoint odd cycles in a bridgeless cubic graph. It treats the six-perfect-matching conjecture as open.

Supported evidence. Replay readiness: source only.

2Evidence

Replay package: source only

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

Verification source: www.sciencedirect.com ↗, abstract, introduction, and discussion of the Berge-Fulkerson consequence

3Overview

Exact unresolved remainder: Construct six perfect matchings covering every edge exactly twice in every bridgeless cubic graph, or give a bridgeless cubic graph and prove that no such cover exists.

4What was measured

As of
2026-08-01
Strongest known result
The linked 2026 article records a consequence of Kardoš and collaborators: a 1-factor can meet any prescribed collection of pairwise edge-disjoint odd cycles in a bridgeless cubic graph. It treats the six-perfect-matching conjecture as open.
Exact open remainder
Construct six perfect matchings covering every edge exactly twice in every bridgeless cubic graph, or give a bridgeless cubic graph and prove that no such cover exists.

5How it connects

Supersedes

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": "R1389",
  "content_hash": null,
  "slug": "berge-fulkerson-conjecture-status-packet-quality-20260801",
  "type": "claim",
  "title": "Dated status and exact unresolved remainder",
  "summary": "Unresolved in this packet after the dated source check. Strongest checked result: The linked 2026 article records a consequence of Kardoš and collaborators: a 1-factor can meet any prescribed collection of pairwise edge-disjoint odd cycles in a bridgeless cubic graph. It treats the six-perfect-matching conjecture as open. Exact unresolved remainder: Construct six perfect matchings covering every edge exactly twice in every bridgeless cubic graph, or give a bridgeless cubic graph and prove that no such cover exists.",
  "relevance": "For Berge-Fulkerson conjecture, this successor gives readable dated status prose and the exact remaining research boundary.",
  "relevance_source": "recorded",
  "body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: The linked 2026 article records a consequence of Kardoš and collaborators: a 1-factor can meet any prescribed collection of pairwise edge-disjoint odd cycles in a bridgeless cubic graph. It treats the six-perfect-matching conjecture as open.\n\nExact unresolved remainder: Construct six perfect matchings covering every edge exactly twice in every bridgeless cubic graph, or give a bridgeless cubic graph and prove that no such cover exists.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.sciencedirect.com/science/article/pii/S019566982600034X",
      "locator": "abstract, introduction, and discussion of the Berge-Fulkerson consequence"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.sciencedirect.com/science/article/pii/S019566982600034X",
    "locator": "abstract, introduction, and discussion of the Berge-Fulkerson consequence"
  },
  "models": [],
  "relations": [
    {
      "slug": "R932",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing"
    },
    {
      "slug": "berge-fulkerson-conjecture",
      "title": "berge fulkerson conjecture",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
berge-fulkerson-conjecture-source-review
Locator
abstract, introduction, and discussion of the Berge-Fulkerson consequence
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1389
Stable alias
berge-fulkerson-conjecture-status-packet-quality-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.