Pages that link to "Item:Q1689997"
From MaRDI portal
The following pages link to The junta method in extremal hypergraph theory and Chvátal's conjecture (Q1689997):
Displaying 12 items.
- Diversity of uniform intersecting families (Q1671747) (← links)
- Partitioning ordered hypergraphs (Q2005178) (← links)
- On set systems without a simplex-cluster and the junta method (Q2010639) (← links)
- On the \(d\)-cluster generalization of Erdős-Ko-Rado (Q2037168) (← links)
- On the number of distinct differences in an intersecting family (Q2214062) (← links)
- Towards a proof of the Fourier-entropy conjecture? (Q2216459) (← links)
- Chromatic numbers of Kneser-type graphs (Q2299637) (← links)
- Families of finite sets satisfying intersection restrictions (Q2309551) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- Regular intersecting families (Q2334049) (← links)
- The weighted complete intersection theorem (Q2363359) (← links)
- Simple juntas for shifted families (Q5126777) (← links)
