Near-sunflowers and focal families
arxiv(2023)
摘要
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.
更多查看译文
关键词
focal families,near-sunflowers
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络