Forbidding a Set Difference of Size 1Report as inadecuate



 Forbidding a Set Difference of Size 1


Forbidding a Set Difference of Size 1 - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: Forbidding a Set Difference of Size 1
How large can a family \cal A \subset \cal P n be if it does not contain A, B with |A\B| = 1? Our aim in this note is to show that any such family has size at most \frac {2 + o(1)}{n} \binom {n}{n-2}. This is best possible up to a multiplicative constant of 2.



Author: Imre Leader; Eoin Long

Source: https://archive.org/







Related documents