The following pages link to Note on sunflowers (Q2032700):
Displaying 12 items.
- Unavoidable hypergraphs (Q1984522) (← links)
- Improved bounds for the sunflower lemma (Q2058613) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Sunflowers: from soil to oil (Q5055337) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)
- THE IONESCU–WAINGER MULTIPLIER THEOREM AND THE ADELES (Q6048827) (← links)
- On restricted intersections and the sunflower problem (Q6121916) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)
- Spread approximations for forbidden intersections problems (Q6493709) (← links)
