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