Triangle-intersecting families of graphs

DOI10.4171/JEMS/320zbMath1238.05143arXiv1010.4909MaRDI QIDQ2428720

Yuval Filmus, Ehud Friedgut, David Ellis

Publication date: 20 April 2012

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.4909

zbMATH Keywords

discrete Fourier analysisintersecting families

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Extremal combinatorics (05D99)

Related Items (25)

Structured Codes of Graphs ⋮ More complete intersection theorems ⋮ Boolean functions: influence, threshold and noise ⋮ Approximation by juntas in the symmetric group, and forbidden intersection problems ⋮ \(K_4\)-intersecting families of graphs ⋮ The junta method in extremal hypergraph theory and Chvátal's conjecture ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Graph-codes ⋮ KKL's influence on me ⋮ Stability for intersecting families in \(\mathrm{PGL}(2,q)\) ⋮ High dimensional Hoffman bound and applications in extremal combinatorics ⋮ On a biased edge isoperimetric inequality for the discrete cube ⋮ Spectral bounds for the independence ratio and the chromatic number of an operator ⋮ A Note on Large H-Intersecting Families ⋮ Connector families of graphs ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Triangle-different Hamiltonian paths ⋮ A quasi-stability result for dictatorships in \(S_n\) ⋮ Unnamed Item ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ 3-setwise intersecting families of the symmetric group ⋮ Invitation to intersection problems for finite sets ⋮ The theta number of simplicial complexes ⋮ On $k$-Neighbor Separated Permutations ⋮ Path Separation by Short Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• On the measure of intersecting families, uniqueness and stability
• Families intersecting on an interval
• Some intersection theorems for ordered sets and graphs
• On the degree of Boolean functions as real polynomials
• Representations of families of triples over \(GF(2)\)
• Anticlusters and intersecting families of subsets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting families of permutations

This page was built for publication: Triangle-intersecting families of graphs