The Upper Limit Of Some Special L-intersection

The combinatorics of finite sets is a important branch of the combinatorial mathematics.For intersecting sets,it is an important research topic to study them.The finite subset of the set of intersecting under the given condition is our research content. We give two results about the upper limit of some specialï¿¡-intersection,and these results are better than before.This paper is divided into three chapters.In chapter one,we introduce some simply situa-tions of the Erdos-Ko-Rado theorem and the main work of this paper.In chapter two,we intro-duce the mathematical symbols and mathematical concepts used in the paper. In chapter three, firstly,we introduce the basics of the study,secondly,we give the obtained conclusions, and fi-nally we prove these conclusions. During the prove, through the change of proof methods and conditions,we get the had better results than before.