Near-sunflowers and focal families

Noga Alon; Ron Holzman

doi:10.1007/s11856-023-2500-1

Near-sunflowers and focal families

Noga Alon, Ron Holzman

Mathematics

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	21-33
Number of pages	13
Journal	Israel Journal of Mathematics
Volume	256
Issue number	1
DOIs	https://doi.org/10.1007/s11856-023-2500-1
State	Published - Sep 2023

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.1007/s11856-023-2500-1

Cite this

@article{14540f9f9134482ca341670ccca64d5f,

title = "Near-sunflowers and focal families",

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{\"o}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{\H o}s–Rado sunflower conjecture.",

author = "Noga Alon and Ron Holzman",

note = "Publisher Copyright: {\textcopyright} 2023, The Hebrew University of Jerusalem.",

year = "2023",

month = sep,

doi = "10.1007/s11856-023-2500-1",

language = "English (US)",

volume = "256",

pages = "21--33",

journal = "Israel Journal of Mathematics",

issn = "0021-2172",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Near-sunflowers and focal families

AU - Alon, Noga

AU - Holzman, Ron

PY - 2023/9

Y1 - 2023/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85173708791&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85173708791&partnerID=8YFLogxK

U2 - 10.1007/s11856-023-2500-1

DO - 10.1007/s11856-023-2500-1

M3 - Article

AN - SCOPUS:85173708791

SN - 0021-2172

VL - 256

SP - 21

EP - 33

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

IS - 1

ER -

Near-sunflowers and focal families

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this