Pages that link to "Item:Q2237385"
From MaRDI portal
The following pages link to The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385):
Displaying 14 items.
- Maximum degree and diversity in intersecting hypergraphs (Q777477) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- Approximation by juntas in the symmetric group, and forbidden intersection problems (Q2671454) (← links)
- Erdős matching conjecture for almost perfect matchings (Q2685338) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
- Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems (Q5126774) (← links)
- Rainbow version of the Erdős Matching Conjecture via concentration (Q5886247) (← links)
- Hypergraphs without non-trivial intersecting subgraphs (Q5886354) (← links)
- Co-degree threshold for rainbow perfect matchings in uniform hypergraphs (Q6051049) (← links)
- Hypercontractivity for global functions and sharp thresholds (Q6053547) (← links)
- Extremal Problem for Matchings and Rainbow Matchings on Direct Products (Q6077978) (← links)
- Spectral radius and rainbow Hamilton paths of a graph (Q6570051) (← links)
- Improved bounds concerning the maximum degree of intersecting hypergraphs (Q6574372) (← links)
- Improved covering results for conjugacy classes of symmetric groups via hypercontractivity (Q6633890) (← links)
