Pages that link to "Item:Q2058613"
From MaRDI portal
The following pages link to Improved bounds for the sunflower lemma (Q2058613):
Displaying 29 items.
- On sunflowers and matrix multiplication (Q354642) (← links)
- An improved upper bound for the size of a sunflower-free family (Q1669672) (← links)
- Note on sunflowers (Q2032700) (← links)
- Sunflowers of convex open sets (Q2334523) (← links)
- Sunflowers in lattices (Q2583667) (← links)
- Multicolour Sunflowers (Q4554777) (← links)
- Sunflowers: from soil to oil (Q5055337) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- (Q5121915) (← links)
- Coding for Sunflowers (Q5126764) (← links)
- UPPER BOUNDS FOR SUNFLOWER-FREE SETS (Q5280253) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- A proof of the Kahn–Kalai conjecture (Q6053546) (← links)
- Hypercontractivity for global functions and sharp thresholds (Q6053547) (← links)
- Sunflowers in set systems of bounded dimension (Q6057492) (← links)
- Near-sunflowers and focal families (Q6076184) (← links)
- Rainbow independent sets in certain classes of graphs (Q6081576) (← links)
- On restricted intersections and the sunflower problem (Q6121916) (← links)
- The Park-Pham theorem with optimal convergence rate (Q6162130) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Threshold for Steiner triple systems (Q6173554) (← links)
- Rainbow powers of a Hamilton cycle in <i>G<sub>n,p</sub></i> (Q6199377) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)
- Odd-sunflowers (Q6543050) (← links)
- A generalization of diversity for intersecting families (Q6612310) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- A short proof of Kahn-Kalai conjecture (Q6614155) (← links)
- Searching for (sharp) thresholds in random structures: where are we now? (Q6658193) (← links)
- Complexity theory. Abstracts from the workshop held June 2--7, 2024 (Q6671624) (← links)
