On the measure of intersecting families, uniqueness and stability

From MaRDI portal
Revision as of 19:10, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:963246

DOI10.1007/S00493-008-2318-9zbMath1199.05319DBLPjournals/combinatorica/Friedgut08OpenAlexW1978122435WikidataQ56213504 ScholiaQ56213504MaRDI QIDQ963246

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




Related Items (47)

More complete intersection theoremsThe weighted complete intersection theoremTRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREMA simple removal lemma for large nearly-intersecting familiesMultiply-intersecting families revisitedApplication of hypergraph Hoffman's bound to intersecting familiesOn the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting familiesVertex isoperimetry and independent set stability for tensor powers of cliquesA semidefinite programming approach to a cross-intersection problem with measuresOn the stability of the Erdős-Ko-Rado theorem\(K_4\)-intersecting families of graphsGraphical designs and extremal combinatoricsTriangle-intersecting families of graphsA new short proof of the EKR theoremKKL's influence on meStrong stability of 3-wise \(t\)-intersecting familiesStability for vertex isoperimetry in the cubeErdős–Ko–Rado for Random Hypergraphs: Asymptotics and StabilityHigh dimensional Hoffman bound and applications in extremal combinatoricsThe maximum measure of 3-wise \(t\)-intersecting familiesOn cross \(t\)-intersecting families of setsAn Erdős-Ko-Rado theorem for cross \(t\)-intersecting familiesA structure theorem for almost low-degree functions on the sliceA Note on Large H-Intersecting FamiliesThe maximum size of intersecting and union families of setsShadows and intersections: Stability and new proofsEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsUniform eventown problemsThe junta method for hypergraphs and the Erdős-Chvátal simplex conjectureOn symmetric intersecting familiesOn the structure of subsets of the discrete cube with small edge boundarySemi-Strong Colouring of Intersecting HypergraphsA multiply intersecting Erdős-Ko-Rado theorem -- the principal caseSet systems without a simplex or a clusterA product version of the Erdős-Ko-Rado theoremFriedgut--Kalai--Naor theorem for slices of the Boolean cubeTight bounds on the coefficients of partition functions via stabilityStability versions of Erdős-Ko-Rado type theorems via isoperimetryInvitation to intersection problems for finite setsRemoval and Stability for Erdös--Ko--RadoGeometric stability via information theoryAK-type stability theorems on cross \(t\)-intersecting familiesCross t-Intersecting Integer Sequences from Weighted Erdős–Ko–RadoA Katona-type proof of an Erdős-Ko-Rado-type theoremPartially Symmetric Functions Are Efficiently Isomorphism TestableUnnamed ItemAn extension of the Erdős–Ko–Rado Theorem




Cites Work




This page was built for publication: On the measure of intersecting families, uniqueness and stability