Pages that link to "Item:Q2383002"
From MaRDI portal
The following pages link to An intersection theorem for four sets (Q2383002):
Displaying 21 items.
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- A structural result for 3-graphs (Q512589) (← links)
- Set systems without a simplex or a cluster (Q532128) (← links)
- A product version of the Erdős-Ko-Rado theorem (Q533340) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- The maximum size of intersecting and union families of sets (Q657996) (← links)
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case (Q960953) (← links)
- Set systems with union and intersection constraints (Q1026003) (← links)
- Two-regular subgraphs of hypergraphs (Q1026004) (← links)
- Sparse hypergraphs with low independence number (Q1705800) (← 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)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- \(d\)-cluster-free sets with a given matching number (Q2323253) (← links)
- Multiply-intersecting families revisited (Q2384803) (← 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)
