Pages that link to "Item:Q2883868"
From MaRDI portal
The following pages link to Compressions and probably intersecting families (Q2883868):
Displaying 13 items.
- A simple removal lemma for large nearly-intersecting families (Q322197) (← links)
- Maximum hitting for \(n\) sufficiently large (Q742567) (← links)
- Compressions of compact tuples (Q1715849) (← links)
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations (Q2133641) (← links)
- Classification of maximum hittings by large families (Q2303424) (← links)
- Most probably intersecting hypergraphs (Q2341073) (← links)
- Removal and stability for Erdős-Ko-Rado (Q2808164) (← links)
- Erdős-Ko-Rado with separation conditions (Q2876024) (← links)
- Most probably intersecting families of subsets (Q2883864) (← links)
- On Compressible Pairings and Their Computation (Q3506394) (← links)
- Probably Intersecting Families are Not Nested (Q4903268) (← links)
- Set Systems Containing Many Maximal Chains (Q5364237) (← links)
- A pushing-pulling method: New proofs of intersection theorems (Q5932697) (← links)