Vol. 8, No. 2, 2019

Download this article
Download this article For screen
For printing
Recent Issues
Volume 11, Issue 4
Volume 11, Issue 3
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 4
Volume 10, Issue 3
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Older Issues
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 2-3
Volume 6, Issue 1
Volume 5, Issue 4
Volume 5, Issue 3
Volume 5, Issue 1-2
Volume 4, Issue 4
Volume 4, Issue 3
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 3-4
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 4
Volume 2, Issue 3
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 4
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
The Journal
About the Journal
Editorial Board
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
founded and published with the
scientific support and advice of
mathematicians from the
Moscow Institute of
Physics and Technology
 
ISSN (electronic): 2640-7361
ISSN (print): 2220-5438
Author Index
To Appear
 
Other MSP Journals
A simple proof of the Hilton–Milner theorem

Peter Frankl

Vol. 8 (2019), No. 2, 97–101
Abstract

Let n 2k 4 be integers and a family of k-subsets of {1,2,,n}. We call intersecting if F F for all F,F, and we call nontrivial if FF = . Strengthening the famous Erdős–Ko–Rado theorem, Hilton and Milner proved that || n1 k1 nk1 k1 + 1 if is nontrivial and intersecting. We provide a proof by injection of this result.

Keywords
finite sets, intersection, hypergraphs
Mathematical Subject Classification 2010
Primary: 05D05
Milestones
Received: 9 October 2017
Accepted: 28 May 2018
Published: 20 May 2019
Authors
Peter Frankl
Rényi Institute
Budapest
Hungary