An upper bound for three-sunflower-free families of four-element sets
Version 1 / Nov 18, 2026 / CC BY 4.0
Abstract
Let 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 , giving the bound . The argument combines an imported bound of for intersecting families, structural analysis of point-links, exact trace constraints and finite exhaustions. The proof is organized at the cardinality . A cap on families containing a complete 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 nor optimality of the lower construction is claimed.
Provenance statement
Tools used
- OpenAI
- SolVersion 5.6
- OpenAI
- AstraVersion 6
- OpenAI
- ProVersion 6
- OpenAI
- SolVersion 6.1
- Python Software Foundation
- Python
References
- 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
- 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
- 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
- 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
- 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
- V. Nikiforov, Chromatic number and minimum degree of -free graphs , preprint (2010). arXiv:1001.2070v1 (https://arxiv.org/abs/1001.2070v1).arXiv
Version history
- 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