Junichiro Fukuyama
Published 2023-01-10Version 1
This paper refines the original construction of the recent proof of the sunflower conjecture to prove the same general bound $[ ck \log (k+1) ]^m$ on the cardinality of a family of $m$-cardinality sets without a sunflower of $k$ elements. Our proof uses a structural claim on an extension of a family that has been previously developed.
Comments: This paper shows another proof of the sunflower conjecture that is different from the one present in arXiv:2212.13609 [math.CO]. Extra information on the two papers is available at Penn State Sites: https://sites.psu.edu/sunflowerconjecture/2023/01/10/index-page/,
An improvement of the general bound on the largest family of subsets avoiding a subposet
From DNF compression to sunflower theorems via regularity
Antimagic Labeling for Unions of Graphs with Many Three-Paths
![QR code for arXiv:2301.04219 [math.CO]](http://oss.arxitics.com/images/favicon.svg)