论文信息 - Intersection theorems for systems of finite vector spaces

Intersection theorems for systems of finite vector spaces

A theorem of Erdos, Ko and Rado states that if S is an n-element set and F is a family of k-element subsets of S, k= = 2k, ...F... = = 2k + 1, ...F... = = 2k + 2 and n >= 2k + 1, q >= 3. Application of these methods to the analogous subset problem leads to improvement on the Erdos-Ko-Rado bounds.

W. N. Hsieh | W. Hsieh

[1] G. Rota,et al. On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions , 1970 .

[2] Gyula O. H. Katona. A simple proof of the Erd?s-Chao Ko-Rado theorem , 1972 .

[3] Gustavus J. Simmons. An Extremal Problem in the Uniform Covering of Finite Sets , 1972, J. Comb. Theory, Ser. A.

[4] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .

[5] Gyula O. H. Katona,et al. Intersection theorems for systems of finite sets , 1964 .