Showing math.COShow all
3 papers · 1 filter
math.CO2018
About sunflowers
Gábor Hegedűs
Alon, Shpilka and Umans considered the following version of usual sunflower-free subset: a subset $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ for is sunflower-free if for ev…
math.CO2017
The Erdős-Ginzburg-Ziv constant and progression-free subsets
Gábor Hegedűs
Ellenberg and Gijswijt gave recently a new exponential upper bound for the size of three-term arithmetic progression free sets in , where is a prime. Petrov…
math.CO2016
Sunflowers and -intersecting families
Gábor Hegedűs
Let stand for the least number so that if is an arbitrary -uniform, -intersecting set system, where , and has more than element…