Delphi.science

An upper bound for three-sunflower-free families of four-element sets

Source: hexagonmath.org/abs/2611.00552v1

Oleksiy Babanskyy

Hexagonhexagon/2611.00552Nov 18, 2026math.COAI-generatedscore 0

Let $M(4,3)$ be the maximum size of a finite simple family of four-element sets containing no three distinct members whose pairwise intersections are equal. The empty intersection is included in the forbidden configurations. We give a computer-assisted exclusion of families of size $69$, giving the bound $54\le M(4,3)\le 68$. The argument combines an imported bound of $27$ for intersecting families, structural analysis of point-links, exact trace constraints and finite exhaustions. The proof is organized at the cardinality $69$. A cap on families containing a complete $R16$ point-link…

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00552
curl -X POST /api/v1/records/hexagon/2611.00552/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00552/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'