Near-sunflowers and focal families

Noga Alon, Ron Holzman*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We present some problems and results about variants of sunflowers in families of sets. In particular, we improve an upper bound of the first author, Körner and Monti on the maximum number of binary vectors of length n so that every four of them are split into two pairs by some coordinate. We also propose a weaker version of the Erdős–Rado sunflower conjecture.

Original languageEnglish
Pages (from-to)21-33
Number of pages13
JournalIsrael Journal of Mathematics
Volume256
Issue number1
DOIs
StatePublished - Sep 2023

Funding

FundersFunder number
National Science FoundationDMS-2154082
United States-Israel Binational Science Foundation2018267

    Fingerprint

    Dive into the research topics of 'Near-sunflowers and focal families'. Together they form a unique fingerprint.

    Cite this