Abstract
The main object of this paper is to determine the maximum number of {0,±1}-vectors subject to the following condition. All vectors have length n, exactly k of the coordinates are +1 and one is −1, n≥2k. Moreover, there are no two vectors whose scalar product equals the possible minimum, −2. Thus, this problem may be seen as an extension of the classical Erdős–Ko–Rado theorem. Rather surprisingly there is a phase transition in the behaviour of the maximum at n=k2. Nevertheless, our solution is complete. The main tools are from extremal set theory and some of them might be of independent interest.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
