Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Deza, P. Frankl (1983)
Erdös-Ko-Rado Theorem-22 Years LaterSIAM J. Alg. Disc. Meth., 4
Shiquan Wu (1993)
At-intersecting Theorem for Finite SequencesJournal of Graduate School of Academia Sinica, 10
P. Erdös, M. Herzos, Schönhein (1970)
An Extremal Problem on Set of Noncoprime Divisor of a NumberIsr. J. of Math., 8
K. Engel, P. Frankl (1986)
An Erdös-Ko-Rado Theorem for Integer Sequences of Given RankEurop. J. Combinatorics, 7
A.J.W. Hilton (1977)
An Intersection Theorem for Collection of Families of Subsets of a Finite SetJ. Lond. Math. Soc., 15
H.D.O.F. Gronnau (1983)
More on the Erdös-Ko-Rado Theorem for Integer SequencesJ. of Comb., A 35
Letn, s 1,s 2, ... ands n be positive integers. Assume $$\mathcal{M}(s_1 ,s_2 , \cdots ,s_n ) = \{ (x_1 ,x_2 , \cdots x_n )|0 \leqslant x_i \leqslant s_i ,x_i$$ is an integer for eachi}. For $$a = (a_1 ,a_2 , \cdots a_n ) \in \mathcal{M}(s_1 ,s_2 , \cdots ,s_n )$$ , $$\mathcal{F} \subseteq \mathcal{M}(s_1 ,s_2 , \cdots ,s_n )$$ , and $$A \subseteq \{ 1,2, \cdots ,n\}$$ , denotes p (a)={j|1≤j≤n,a j ≥p}, $$S_p (\mathcal{F}) = \{ s_p (a)|a \in \mathcal{F}\}$$ , and $$W_p (A) = p^{n - |A|} \prod\limits_{i \in A} {(s_i - p)}$$ . $$\mathcal{F}$$ is called anI t p -intersecting family if, for any a,b∈ $$\mathcal{F}$$ ,a i Λb i =min(a i ,b i )≥p for at leastt i's. $$\mathcal{F}$$ is called a greedyI t P -intersecting family if $$\mathcal{F}$$ is anI t p -intersecting family andW p (A)≥W p (B+A c ) for anyAεS p ( $$\mathcal{F}$$ ) and any $$B \subseteq A$$ with |B|=t−1.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 16, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.