Katona’s Intersection Theorem: Four Proofs
暂无分享,去创建一个
It is known from a previous paper [3] that Katona’s Intersection Theorem follows from the Complete Intersection Theorem by Ahlswede and Khachatrian via a Comparison Lemma. It also has been proved directly in [3] by the pushing–pulling method of that paper. Here we add a third proof via a new (k,k+1)-shifting technique, whose impact will be exploared elsewhere. The fourth and last of our proofs is a gift from heaven for Gyula’s birthday.
[1] Rudolf Ahlswede,et al. The Complete Intersection Theorem for Systems of Finite Sets , 1997, Eur. J. Comb..
[2] D. Kleitman. On a combinatorial conjecture of Erdös , 1966 .
[3] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .
[4] Rudolf Ahlswede,et al. Contributions to the geometry of hamming spaces , 1977, Discret. Math..
[5] Rudolf Ahlswede,et al. A Pushing-Pulling Method: New Proofs of Intersection Theorems , 1999, Comb..