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

Primarily AI-generated textHuman understanding: no partsmath.CO — Combinatorics

Contributed by Oleksiy Babanskyy ↗

Version 1 / Nov 18, 2026 / CC BY 4.0

Abstract

Let M(4,3)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 6969, giving the bound 54≤M(4,3)≤6854\le M(4,3)\le 68. The argument combines an imported bound of 2727 for intersecting families, structural analysis of point-links, exact trace constraints and finite exhaustions. The proof is organized at the cardinality 6969. A cap on families containing a complete R16R16 point-link provides a shorter final contradiction. We make the imported results, computational lemma contracts and remaining verification limits explicit. The lower construction is classical. Neither exclusion of size 6868 nor optimality of the lower construction is claimed.

Author comments: 17 pages. Manuscript unchanged from aiXiv 2610.01292 v1. The claimed bound is 54 <= M(4,3) <= 68, with empty kernels included; the forcing threshold is at most 69. This is partial progress on the finite four-uniform case, not a solution of the general sunflower conjecture (Erdos Problem #20). Pinned companion: https://github.com/aconsciousfractal/Four-Uniform-Three-Sunflower-Bound/tree/90c03c79bcf44eb8f61dff1b86091b822cc4cd3c

Provenance statement

Generative AI tools assisted proof development, software preparation and manuscript review, as disclosed in the manuscript. The author reports using OpenAI Sol 5.6, Astra 6, Pro 6 and Sol 6.1. These names preserve the author's disclosure for the previous deposit; they are not model names quoted from the manuscript, and no individual lemma is assigned to a particular model. Oleksiy Babanskyy is the human author and is responsible for the claims and attributions. The author declares that no part of the contribution has been checked and understood by a human; author-side AI reviews and computational checks are not represented as human understanding or independent specialist verification. The proof excludes a family of size 69. It imports H27, the intersecting-family bound of 27 in Axante et al., arXiv:2609.06175v1, Proposition 6.7. Its original exhaustive search is not rerun by the companion. Jin's strict graph-homomorphism theorem is used in the formulation of Nikiforov's Theorem A. The proof's local cap of 61 applies only to families with a complete R16 point-link, not to arbitrary families. The 54-member lower construction is classical. Neither exclusion of size 68, the exact value M(4,3), optimality of 54, nor the general Erdos-Rado sunflower conjecture is claimed. The comparison with the upper bound 83 is pinned to Axante et al. v1 and does not certify record priority. The author-side audit of 9 October 2026 recorded all 42 finite verification suites passing in both normal and optimized Python, with identical semantic results across the 42 pairs. Those replays and AI reviews support the finite computations; the written reductions and external imported results remain essential. No end-to-end formal proof or independent specialist endorsement is supplied. For this unchanged deposit, repository integrity, source identity and target compilation are checked; the complete scientific replay is not repeated. Prior deposit: https://aixiv.online/abs/2610.01292v1 Pinned source, companion and reproduction instructions: https://github.com/aconsciousfractal/Four-Uniform-Three-Sunflower-Bound/tree/90c03c79bcf44eb8f61dff1b86091b822cc4cd3c

Tools used

OpenAI
SolVersion 5.6
OpenAI
AstraVersion 6
OpenAI
ProVersion 6
OpenAI
SolVersion 6.1
Python Software Foundation
Python

References

  1. P. Erdős and R. Rado, Intersection theorems for systems of sets, Journal of the London Mathematical Society 35 (1960), 85--90. doi:10.1112/jlms/s1-35.1.85 (https://doi.org/10.1112/jlms/s1-35.1.85).DOI
  2. H. L. Abbott and D. Hanson, On finite Delta-systems, Discrete Mathematics 8 (1974), 1--12. doi:10.1016/0012-365X(74)90103-4 (https://doi.org/10.1016/0012-365X(74)90103-4).DOI
  3. H. L. Abbott, D. Hanson and N. Sauer, Intersection theorems for systems of sets, Journal of Combinatorial Theory, Series A 12 (1972), 381--389. doi:10.1016/0097-3165(72)90103-3 (https://doi.org/10.1016/0097-3165(72)90103-3).DOI
  4. E. Axante, C. Budala, D. Chitic, B. Dumitru and M. Nacu, Sunflower-Free Uniform Families: Recursive Constructions and Explicit Bounds , preprint (2026). arXiv:2609.06175v1 (https://arxiv.org/abs/2609.06175v1).arXiv
  5. G. Jin, Triangle-Free Graphs with High Minimal Degrees, Combinatorics, Probability and Computing 2 (4) (1993), 479--490. doi:10.1017/S0963548300000845 (https://doi.org/10.1017/S0963548300000845).DOI
  6. V. Nikiforov, Chromatic number and minimum degree of KrK_r-free graphs , preprint (2010). arXiv:1001.2070v1 (https://arxiv.org/abs/1001.2070v1).arXiv

Version history

  1. v1 · 17 pagesSubmitted by Oleksiy Babanskyy17 pages. Manuscript unchanged from aiXiv 2610.01292 v1. The claimed bound is 54 <= M(4,3) <= 68, with empty kernels included; the forcing threshold is at most 69. This is partial progress on the finite four-uniform case, not a solution of the general sunflower conjecture (Erdos Problem #20). Pinned companion: https://github.com/aconsciousfractal/Four-Uniform-Three-Sunflower-Bound/tree/90c03c79bcf44eb8f61dff1b86091b822cc4cd3cCurrentNov 17, 2026