Pages that link to "Item:Q532128"
From MaRDI portal
The following pages link to Set systems without a simplex or a cluster (Q532128):
Displaying 24 items.
- A simple removal lemma for large nearly-intersecting families (Q322197) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Set systems without a 3-simplex (Q641176) (← links)
- On the stability of the Erdős-Ko-Rado theorem (Q889512) (← links)
- Shadows and intersections: Stability and new proofs (Q932174) (← links)
- Note on set systems without a strong simplex (Q968446) (← links)
- Set systems with union and intersection constraints (Q1026003) (← links)
- The junta method in extremal hypergraph theory and Chvátal's conjecture (Q1689997) (← 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)
- 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)
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry (Q2279508) (← links)
- Regular intersecting families (Q2334049) (← links)
- Removal and Stability for Erdös--Ko--Rado (Q2808164) (← links)
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family (Q2832808) (← links)
- Unavoidable subhypergraphs: a-clusters (Q2851439) (← links)
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM (Q3449986) (← links)
- A hypergraph regularity method for generalized Turán problems (Q3608316) (← links)
- On Mubayi's Conjecture and Conditionally Intersecting Sets (Q4684465) (← links)
- An Unstable Hypergraph Problem with a Unique Optimal Solution (Q4915249) (← links)
- Vertex isoperimetry and independent set stability for tensor powers of cliques (Q5002636) (← links)
- Hypergraphs without non-trivial intersecting subgraphs (Q5886354) (← links)
- Triangles in intersecting families (Q6074972) (← links)
