{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1261",
  "content_hash": null,
  "slug": "erdos-problem-82-attempt-resolution-route",
  "type": "attempt",
  "title": "Resolve the stated acceptance condition",
  "summary": "Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \\(n\\), let \\(F(n)\\) denote the largest integer such that every finite simple graph on \\(n\\) vertices contains a regular induced subgraph with at least \\(F(n)\\) vertices. Here, a regular induced subgraph of a graph \\(G\\) is an induced subgraph that is \\(k\\)-regular for some non-negative integer \\(k\\), meaning every vertex in the subgraph has exactly \\(k\\) neighbors within the subgraph. Determine whether \\(\\displaystyle \\frac{F(n)}{\\log n} \\to \\infty\\) as \\(n \\to \\infty\\).",
  "relevance": "For Asymptotic growth of the maximum guaranteed order of a regular induced subgraph, record erdos-problem-82-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \\(n\\), let \\(F(n)\\) denote the largest integer such that every finite simple graph on \\(n\\) vertices contains a regular induced subgraph with at least \\(F(n)\\) vertices.",
  "relevance_source": "recorded",
  "body": "Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 82: For each positive integer \\(n\\), let \\(F(n)\\) denote the largest integer such that every finite simple graph on \\(n\\) vertices contains a regular induced subgraph with at least \\(F(n)\\) vertices. Here, a regular induced subgraph of a graph \\(G\\) is an induced subgraph that is \\(k\\)-regular for some non-negative integer \\(k\\), meaning every vertex in the subgraph has exactly \\(k\\) neighbors within the subgraph. Determine whether \\(\\displaystyle \\frac{F(n)}{\\log n} \\to \\infty\\) as \\(n \\to \\infty\\). 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://www.erdosproblems.com/82",
      "locator": "Editorial research route recorded 2026-07-31"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.erdosproblems.com/82",
    "locator": "Editorial research route recorded 2026-07-31"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1262",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "erdos-problem-82",
      "title": "erdos problem 82",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}