The following pages link to Erdős--Ko--Rado for three sets (Q2368657):
Displaying 17 items.
- A structural result for 3-graphs (Q512589) (← links)
- Set systems without a simplex or a cluster (Q532128) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Set systems with union and intersection constraints (Q1026003) (← 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)
- Structural results for conditionally intersecting families and some applications (Q2185223) (← links)
- New results on simplex-clusters in set systems (Q2236657) (← links)
- \(d\)-cluster-free sets with a given matching number (Q2323253) (← links)
- An intersection theorem for four sets (Q2383002) (← links)
- Non-trivial 3-wise intersecting uniform families (Q2689515) (← links)
- Unavoidable subhypergraphs: a-clusters (Q2851439) (← links)
- Simplex Stability (Q3557500) (← links)
- On Mubayi's Conjecture and Conditionally Intersecting Sets (Q4684465) (← links)
- Uniform hypergraphs under certain intersection constraints between hyperedges (Q6113513) (← links)
- On Multicolor Ramsey Numbers of Triple System Paths of Length 3 (Q6170440) (← links)
