4.2 Article

Sunflowers in Set Systems of Bounded Dimension

Related references

Note: Only part of the references are listed.
Article Mathematics

Improved bounds for the sunflower lemma

Ryan Alweiss et al.

Summary: The sunflower lemma states that for a family of sets of size w, containing at least about w(w) sets, there must be a sunflower with r petals. This paper presents a new definition for sunflowers and improves the bound on the number of sets to about (log w)(w).

ANNALS OF MATHEMATICS (2021)

Article Mathematics

MODEL THEORY AND MACHINE LEARNING

Hunter Chase et al.

BULLETIN OF SYMBOLIC LOGIC (2019)

Article Computer Science, Theory & Methods

Erds-Hajnal Conjecture for Graphs with Bounded VC-Dimension

Jacob Fox et al.

DISCRETE & COMPUTATIONAL GEOMETRY (2019)

Article Mathematics, Applied

UPPER BOUNDS FOR SUNFLOWER-FREE SETS

Eric Naslund et al.

FORUM OF MATHEMATICS SIGMA (2017)

Article Computer Science, Theory & Methods

Selecting points that are heavily covered by pseudo-circles, spheres or rectangles

S Smorodinsky et al.

COMBINATORICS PROBABILITY & COMPUTING (2004)