Proof of an intersection theorem via graph homomorphisms

zbMATH Open1087.05060MaRDI QIDQ819191FDOQ819191

Authors: Irit Dinur, Ehud Friedgut 

Publication date: 22 March 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/125956

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A note on large \(H\)-intersecting families
• On the measure of intersecting families, uniqueness and stability
• More complete intersection theorems
• scientific article; zbMATH DE number 2212132
• Triangle-intersecting families of graphs

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cited In (4)

• More complete intersection theorems
• Measure preserving homomorphisms and independent sets in tensor graph powers
• Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
• On the measure of intersecting families, uniqueness and stability

This page was built for publication: Proof of an intersection theorem via graph homomorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819191)