Abstract
Maximum families of subsets satisfying some specified conditions are widely studied in combinatorics on set systems. In this paper, an extremal problem on subsets is considered. Let C kn denote the set of all k-subsets of an n- set. Assume A ⊂ C an and B ⊂ C bn , (A B) is called a cross-t-intersecting family if ¦ A ∩ B ¦≥ t for any A ∈ A, B ∈ B. For t=3, maximum non-empty cross-3-intersecting families of a- and b- subsets are obtained.
Partially supported by National Natural Science Foundation of China (No.19401008) and by Postdoctoral Science Foundation of China.
Preview
Unable to display preview. Download preview PDF.
References
Anderson,I.,Combinatorics of finite sets, Oxford, 1987
Frankl, P. and Tokushige, N., Some best possible inequalities concerning cross-intersecting families, J. Combin. Th. Ser. A61 (1992), 87–97.
Hilton, A. J. W. and Milner, E.C., Some intersection theorems for systems of finite sets, Quart. J. Math. Oxford 18 (2) (1967),369–384.
Matsumoto,M., The exact bound in Erdös-Ko-Rado Theorem for cross-intersecting families, J. Comb. Theory A52 (1989), 90–97.
Simpson,J.E., A bipartite Erdös-Ko-Rado Theorem, Discrete Mathematics 113(1993)277–280.
Wu Shiquan, Non-empty cross-2-intersecting families of subsets, Applied Mathematics: A Journal of Chinese Universities, B8(1993)2,176–182.
Wu Shiquan, Cross-t-intersection theorems of subsets, Technical Report of the Center of Mathematical Sciences,Zhejiang University,n1(1994).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, S. (1995). Non-empty cross-3-intersection theorems of subsets. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030850
Download citation
DOI: https://doi.org/10.1007/BFb0030850
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive