Spread approximations for forbidden intersections problems
From MaRDI portal
Recommendations
- Approximation by juntas in the symmetric group, and forbidden intersection problems
- Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erd\H{o}s and S\'os
- Frankl-Rödl-type theorems for codes and permutations
- On t-Intersecting Families of Permutations
- Forbidding just one intersection, for permutations
Cites work
- Are many small sets explicitly small?
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Forbidden Intersections
- Intersecting families of permutations
- Intersection theorems with geometric consequences
- Note on sunflowers
- On symmetric intersecting families
- On the maximum number of permutations with given maximal or minimal distance
- The complete intersection theorem for systems of finite sets
- Threshold functions
Cited in
(13)- A smoother notion of spread hypergraphs
- Improved covering results for conjugacy classes of symmetric groups via hypercontractivity
- Intersection theorems for families of matchings of complete k-partite k-graphs
- Intersecting families with covering number 3
- The minimum number of cliques in induced subgraphs of Johnson graphs
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
- Forbidden sparse intersections
- Stability of large rainbow intersecting families with product measure
- On set systems without singleton intersections
- Set systems containing no singleton intersection and the Delsarte number
- Tiling the symmetric group by transpositions
- Erdős-Ko-Rado theorem and Hilton-Milner type theorem for k-partitions
- A note on the maximum diversity of intersecting families in the symmetric group
This page was built for publication: Spread approximations for forbidden intersections problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493709)
