Abstract
Two families and of sets are said to be cross--intersecting if each set in intersects each set in in at least elements. An active problem in extremal set theory is to determine the maximum product of sizes of cross--intersecting subfamilies of a given family. We prove a cross--intersection theorem for weighted subsets of a set by means of a new subfamily alteration method, and use the result to provide solutions for three natural families. For , let be the family of -element subsets of , and let be the family of subsets of that have at most elements. Let be the family of sets in that contain . We show that if and are functions that obey certain conditions, , , and and are cross--intersecting, then and equality holds if and . We prove this in a more general setting and characterise the cases of equality. We use the result to show that the maximum product of sizes of two cross--intersecting families and is for , where is close to best possible. We obtain analogous results for families of integer sequences and for families of multisets. The results yield generalisations for cross--intersecting families, and Erdos-Ko-Rado-type results.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.