On the measure of intersecting families, uniqueness and stability
From MaRDI portal
Publication:963246
DOI10.1007/s00493-008-2318-9zbMath1199.05319OpenAlexW1978122435WikidataQ56213504 ScholiaQ56213504MaRDI QIDQ963246
Publication date: 8 April 2010
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-008-2318-9
Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (47)
More complete intersection theorems ⋮ The weighted complete intersection theorem ⋮ TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM ⋮ A simple removal lemma for large nearly-intersecting families ⋮ Multiply-intersecting families revisited ⋮ Application of hypergraph Hoffman's bound to intersecting families ⋮ On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families ⋮ Vertex isoperimetry and independent set stability for tensor powers of cliques ⋮ A semidefinite programming approach to a cross-intersection problem with measures ⋮ On the stability of the Erdős-Ko-Rado theorem ⋮ \(K_4\)-intersecting families of graphs ⋮ Graphical designs and extremal combinatorics ⋮ Triangle-intersecting families of graphs ⋮ A new short proof of the EKR theorem ⋮ KKL's influence on me ⋮ Strong stability of 3-wise \(t\)-intersecting families ⋮ Stability for vertex isoperimetry in the cube ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ High dimensional Hoffman bound and applications in extremal combinatorics ⋮ The maximum measure of 3-wise \(t\)-intersecting families ⋮ On cross \(t\)-intersecting families of sets ⋮ An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families ⋮ A structure theorem for almost low-degree functions on the slice ⋮ A Note on Large H-Intersecting Families ⋮ The maximum size of intersecting and union families of sets ⋮ Shadows and intersections: Stability and new proofs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Uniform eventown problems ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ On symmetric intersecting families ⋮ On the structure of subsets of the discrete cube with small edge boundary ⋮ Semi-Strong Colouring of Intersecting Hypergraphs ⋮ A multiply intersecting Erdős-Ko-Rado theorem -- the principal case ⋮ Set systems without a simplex or a cluster ⋮ A product version of the Erdős-Ko-Rado theorem ⋮ Friedgut--Kalai--Naor theorem for slices of the Boolean cube ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ Invitation to intersection problems for finite sets ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ Geometric stability via information theory ⋮ AK-type stability theorems on cross \(t\)-intersecting families ⋮ Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado ⋮ A Katona-type proof of an Erdős-Ko-Rado-type theorem ⋮ Partially Symmetric Functions Are Efficiently Isomorphism Testable ⋮ Unnamed Item ⋮ An extension of the Erdős–Ko–Rado Theorem
Cites Work
- The complete intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- Proof of an intersection theorem via graph homomorphisms
- Finite projective spaces and intersecting hypergraphs
- Beyond the Erdős-Ko-Rado theorem
- Graph products, Fourier analysis and spectral techniques
- On the distribution of the Fourier spectrum of Boolean functions
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Independent sets in graph powers are almost contained in juntas
- A Katona-type proof of an Erdős-Ko-Rado-type theorem
- Constant depth circuits, Fourier transform, and learnability
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting Families are Essentially Contained in Juntas
- The importance of being biased
- Probabilities for Intersecting Systems and Random Subsets of Finite Sets
- On the Shannon capacity of a graph
- Weighted multiply intersecting families
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On intersecting families of finite sets
This page was built for publication: On the measure of intersecting families, uniqueness and stability
