Frankl-Füredi type inequalities for polynomial semi-lattices

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Let X be an n-set and L a set of nonnegative integers. F, a set of subsets of X, is said to be an L-intersection family if and only if for all E ≠ F ∈ F, |E∩F| ∈ L. A special case of a conjecture of Frankl and Füredi [4] states that if L = {1,2,..., k}, k a positive integer, then |F| ≤ ∑i-0k (in-1). Here |F| denotes the number of elements in F. Recently Ramanan proved this conjecture in [6] We extend his method to polynomial semi-lattices and we also study some special L-intersection families on polynomial semi-lattices. Finally we prove two modular versions of Ray-Chaudhuri-Wilson inequality for polynomial semi-lattices.

Cite

CITATION STYLE

APA

Qian, J., & Ray-Chaudhuri, D. K. (1997). Frankl-Füredi type inequalities for polynomial semi-lattices. Electronic Journal of Combinatorics, 4(1 R), 1–15. https://doi.org/10.37236/1313

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free