{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1219",
  "content_hash": null,
  "slug": "erdos-problem-20-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 20: For positive integers $n$ and $k$, let $f(n,k)$ denote the smallest integer such that every family of $n$-element sets with at least $f(n,k)$ members contains $k$ sets whose pairwise intersections are all equal (such a configuration is called a $k$-sunflower). Does there exist a function $c \\colon \\mathbb{N} \\to \\mathbb{N}$ such that for all positive integers $n$ and all positive integers $k$, the inequality $f(n,k) < (c(k))^n$ holds?",
  "relevance": "For Erdős–Rado sunflower threshold growth rate, record erdos-problem-20-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 20: For positive integers $n$ and $k$, let $f(n,k)$ denote the smallest integer such that every family of $n$-element sets with at least $f(n,k)$ members contains $k$ sets whose pairwise intersections are all equal (such a configuration is called a $k$-sunflower).",
  "relevance_source": "recorded",
  "body": "Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 20: For positive integers $n$ and $k$, let $f(n,k)$ denote the smallest integer such that every family of $n$-element sets with at least $f(n,k)$ members contains $k$ sets whose pairwise intersections are all equal (such a configuration is called a $k$-sunflower). Does there exist a function $c \\colon \\mathbb{N} \\to \\mathbb{N}$ such that for all positive integers $n$ and all positive integers $k$, the inequality $f(n,k) < (c(k))^n$ holds? 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/20",
      "locator": "Editorial research route recorded 2026-07-31"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.erdosproblems.com/20",
    "locator": "Editorial research route recorded 2026-07-31"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1220",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "erdos-problem-20",
      "title": "erdos problem 20",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}