Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Non-empty cross-2-intersecting families of subsets

Non-empty cross-2-intersecting families of subsets Abstract LetC kn denote the set of allk-subsets of ann-set. AssumeA ⊆C a n and ℬ ⊆C b n . (A, ℬ) is called a cross-2-intersecting family if |A∩B|≥2 for anyA ∈ A,B ∈ ℬ. In this paper, the best upper bounds of the cardinalities for non-empty cross-2-intersecting families ofa- andb- subsets are obtained for somea andb. A new proof for a Frankl-Tokushige theorem [6] is also given. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics-A Journal of Chinese Universities Springer Journals

Non-empty cross-2-intersecting families of subsets

Download PDF
7 pages

Loading next page...
 
/lp/springer-journals/non-empty-cross-2-intersecting-families-of-subsets-INxtJLD5O1
Publisher
Springer Journals
Copyright
1993 Editorial Committee of Applied Mathematics-A Journal of Chinese Universities
ISSN
1005-1031
eISSN
1993-0445
DOI
10.1007/BF02662001
Publisher site
See Article on Publisher Site

Abstract

Abstract LetC kn denote the set of allk-subsets of ann-set. AssumeA ⊆C a n and ℬ ⊆C b n . (A, ℬ) is called a cross-2-intersecting family if |A∩B|≥2 for anyA ∈ A,B ∈ ℬ. In this paper, the best upper bounds of the cardinalities for non-empty cross-2-intersecting families ofa- andb- subsets are obtained for somea andb. A new proof for a Frankl-Tokushige theorem [6] is also given.

Journal

Applied Mathematics-A Journal of Chinese Universities – Springer Journals

Published: Dec 1, 1993

References

  • Anderson, I., Combinatorics of Finit Sets, Oxford, 1987.
    Anderson, I., Combinatorics of Finit Sets, Oxford,
  • Du, Dingzhu and Zevi Miller, Matroids and subset intersection design.SIAM J. Discrete Math.1 (1988).
    Du, Dingzhu and Zevi Miller, Matroids and subset intersection design.SIAM J. Discrete Math.
  • Intersection theorems for systems of finite sets
    P. Erdös, C. Ko, R. Rado
  • Interval Order and Interval Graphs: A Study of Partially Ordered Sets
    P. Fishburn
  • Non-trivial intersecting families
    P. Frankl, Z. Füredi
  • Some best possible inequalities concerning cross-intersecting families
    P. Frankl, N. Tokushige
  • Proof techniques in the theory of finite sets
    C. Greene, D. J. Kleitman
  • Some intersection theorems for systems of finite sets
    A. J. W. Hilton, E. C. Milner
  • The exact bound in Erdös-Ko-Rado Theorem for cross-intersecting families
    M. Mastumoto
  • Rival, I., Ordered Sets, D. Reidel, 1982.
    Rival, I., Ordered Sets, D. Reidel,
  • Special Issue, Combinatorics of ordered sets,Discrete Mathematics88 (1991).
    Special Issue, Combinatorics of ordered sets,Discrete Mathematics