Name
Abstract | ||
|---|---|---|
Let A = {A(1);...; A(p)} and B = {B-1;...; B-q} be two families of subsets of [n] such that for every i is an element of [p] and j is an element of [q], vertical bar A(i) boolean AND B-j vertical bar = c/d is an element of[0, 1] where is an irreducible fraction. We call such families c d-cross intersecting families. In this paper, we find a tight upper bound for the product vertical bar A vertical bar vertical bar B vertical bar and characterize the cases when this bound is achieved for c/d = 1/2. Also, we find a tight upper bound on vertical bar A vertical bar vertical bar B vertical bar when B is k-uniform and characterize, for all c d, the cases when this bound is achieved. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s00373-020-02257-7 | GRAPHS AND COMBINATORICS |
Keywords | DocType | Volume |
Cross-intersecting family, Fractional intersecting family, Linear code, Cross-bisecting family | Journal | 37 |
Issue | ISSN | Citations |
2 | 0911-0119 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rogers Mathew | 1 | 89 | 14.54 |
| Ritabrata Ray | 2 | 0 | 0.34 |
| Shashank Srivastava | 3 | 0 | 3.04 |