On the measure of intersecting families, uniqueness and stability
From MaRDI portal
(Redirected from Publication:963246)
Recommendations
Cites work
- A Katona-type proof of an Erdős-Ko-Rado-type theorem
- Beyond the Erdős-Ko-Rado theorem
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Constant depth circuits, Fourier transform, and learnability
- Finite projective spaces and intersecting hypergraphs
- Graph products, Fourier analysis and spectral techniques
- Independent sets in graph powers are almost contained in juntas
- Intersecting Families are Essentially Contained in Juntas
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On intersecting families of finite sets
- On the distribution of the Fourier spectrum of Boolean functions
- On the Shannon capacity of a graph
- Probabilities for Intersecting Systems and Random Subsets of Finite Sets
- Proof of an intersection theorem via graph homomorphisms
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The complete intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- The importance of being biased
- Weighted multiply intersecting families
Cited in
(57)- More complete intersection theorems
- Diversity of uniform intersecting families
- A semidefinite programming approach to a cross-intersection problem with measures
- On cross t-intersecting families of sets
- On symmetric intersecting families
- Application of hypergraph Hoffman's bound to intersecting families
- Graphical designs and extremal combinatorics
- Stability for vertex isoperimetry in the cube
- A structure theorem for almost low-degree functions on the slice
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- AK-type stability theorems on cross t-intersecting families
- The weighted complete intersection theorem
- Multiply-intersecting families revisited
- Triangle-intersecting families of graphs
- A Katona-type proof of an Erdős-Ko-Rado-type theorem
- Erdős-Ko-Rado and Hilton-Milner theorems for two-forms
- High dimensional Hoffman bound and applications in extremal combinatorics
- The maximum measure of 3-wise t-intersecting families
- Removal and stability for Erdős-Ko-Rado
- Geometric stability via information theory
- Cross t-intersecting integer sequences from weighted Erdős-Ko-Rado
- Friedgut-Kalai-Naor theorem for slices of the Boolean cube
- On the Erdős-Ginzburg-Ziv invariant and zero-sum Ramsey number for intersecting families
- A simple removal lemma for large nearly-intersecting families
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- An extension of the Erdős–Ko–Rado Theorem
- Transference for the Erdős-Ko-Rado theorem
- A new short proof of the EKR theorem
- An Erdős-Ko-Rado theorem for cross t-intersecting families
- A note on large H-intersecting families
- Testing submodularity and other properties of valuation functions
- On the structure of subsets of the discrete cube with small edge boundary
- Uniform eventown problems
- Vertex isoperimetry and independent set stability for tensor powers of cliques
- Partially symmetric functions are efficiently isomorphism testable
- Set systems without a simplex or a cluster
- A product version of the Erdős-Ko-Rado theorem
- Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
- Semi-strong colouring of intersecting hypergraphs
- Tight bounds on the coefficients of partition functions via stability
- \(K_4\)-intersecting families of graphs
- KKL's influence on me
- Strong stability of 3-wise t-intersecting families
- The maximum size of intersecting and union families of sets
- On the largest product-free subsets of the alternating groups
- Short proofs of three results about intersecting systems
- Intersecting families with covering number 3
- Testing intersecting and union-closed families
- Stability of large rainbow intersecting families with product measure
- Extremal problems for intersecting families of subspaces with a measure
- Unified bounds for the independence number of graphs
- Invitation to intersection problems for finite sets
- Proof of an intersection theorem via graph homomorphisms
- On the stability of the Erdős-Ko-Rado theorem
- Shadows and intersections: Stability and new proofs
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
This page was built for publication: On the measure of intersecting families, uniqueness and stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963246)
