{
  "abstract": "We call a family of s $s$ s sets { F 1 , … , F s } $\\{F_1, \\ldots , F_s\\}$ StartSet upper F 1 comma ellipsis comma upper F Subscript s Baseline EndSet a sunflower with s $s$ s petals if, for any distinct i , j ∈ [ s ] $i, j \\in [s]$ i comma j element of left bracket s right bracket , one has F i ∩ F j = ∩ u = 1 s F u $F_i \\cap F_j = \\cap _{u = 1}^s F_u$ upper F Subscript i Baseline intersection upper F Subscript j Baseline equals intersection Underscript u equals 1 Overscript s Endscripts upper F Subscript u . The set C = ∩ u = 1 s F u $C = \\cap _{u = 1}^s F_u$ upper C equals intersection Underscript u equals 1 Overscript s Endscripts upper F Subscript u is called the core of the sunflower. It is a classical result of Erdős and Rado that there is a function ϕ ( s",
  "abstract_shown": true,
  "affiliations": [
    "Moscow Institute of Physics and Technology",
    "Moscow Institute of Physics and Technology and HSE University"
  ],
  "article_type": null,
  "arxiv": null,
  "author_total": 2,
  "authors": [
    {
      "affs": [
        0
      ],
      "name": "Andrey Borisovich Kupavskii",
      "orcid": "0000-0002-8313-9598"
    },
    {
      "affs": [
        1
      ],
      "name": "Fedor Noskov",
      "orcid": "0000-0002-0182-551X"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/exfznb8077ccj.bib",
  "cited_by": 15,
  "doi": "10.1017/fms.2026.10264",
  "fulltext_url": null,
  "id": "exfznb8077ccj",
  "issns": [
    "2050-5094"
  ],
  "landing_url": "https://doi.org/10.1017/fms.2026.10264",
  "language": "en",
  "licence": "CC-BY",
  "licence_label": "CC BY",
  "licence_source": "journal",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "openalex",
      "2607|Limits and Structures in Graph Theory"
    ]
  ],
  "openalex": "W7213020700",
  "pdf_url": "https://www.cambridge.org/core/services/aop-cambridge-core/content/view/0A5B4619BC65C9D950B10D9698CBEFC2/S2050509426102643a.pdf/div-class-title-linear-dependencies-polynomial-factors-in-the-duke-erd-s-forbidden-sunflower-problem-div.pdf",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-14",
  "publisher": "Cambridge University Press",
  "ris": "https://research.draconitic.com/paper/exfznb8077ccj.ris",
  "sources": [
    {
      "first_seen": "2026-11-16T13:20:32Z",
      "native_id": "W7213020700",
      "source": "openalex",
      "url": "https://doi.org/10.1017/fms.2026.10264"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "openalex:2607|Limits and Structures in Graph Theory",
      "subfield": "combinatorics"
    }
  ],
  "title": "Linear dependencies, polynomial factors in the Duke–Erdős forbidden sunflower problem",
  "title_text": "Linear dependencies, polynomial factors in the Duke–Erdős forbidden sunflower problem",
  "type": "peer-reviewed",
  "updated_at": "2026-11-16T13:20:32Z",
  "url": "https://research.draconitic.com/paper/exfznb8077ccj",
  "venue": "Forum of Mathematics Sigma",
  "versions": []
}