{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1433",
  "content_hash": null,
  "slug": "common-chromatic-subgraph-aleph-one-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 \\(\\aleph_1\\)-chromatic graph contains all sufficiently large odd cycles, so a common subgraph of chromatic number three is guaranteed. Exact unresolved remainder: The first unknown guaranteed chromatic number is four; the countably infinite target is stronger.",
  "relevance": "This is the dated publication status for the canonical target A common high-chromatic subgraph of two \\(\\aleph_1\\)-chromatic graphs.",
  "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 \\(\\aleph_1\\)-chromatic graph contains all sufficiently large odd cycles, so a common subgraph of chromatic number three is guaranteed.\n\nThe exact unresolved remainder is: The first unknown guaranteed chromatic number is four; the countably infinite target is stronger.\n\nA complete resolution must meet the following acceptance conditions:\n- Prove the existence of a common \\(4\\)-chromatic subgraph for every pair, or construct a pair with no such common subgraph.\n- Resolve separately the stronger \\(\\aleph_0\\)-chromatic version.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.erdosproblems.com/62",
      "locator": "Thomas F. Bloom, Erdős Problem #62, Erdős Problems database (living entry), accessed 2026-08-01. Problem #62, OPEN banner, statement, remarks, and bibliography"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.erdosproblems.com/62",
    "locator": "Thomas F. Bloom, Erdős Problem #62, Erdős Problems database (living entry), accessed 2026-08-01. Problem #62, OPEN banner, statement, remarks, and bibliography"
  },
  "relations": [
    {
      "slug": "R1432",
      "title": "Strongest checked neighboring result",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R1430",
      "title": "Dated source and duplicate audit",
      "object_type": "attempt",
      "relation": "evidences",
      "direction": "incoming"
    },
    {
      "slug": "R1431",
      "title": "Work at the unresolved boundary",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "common-chromatic-subgraph-aleph-one",
      "title": "common chromatic subgraph aleph one",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}