Name
Abstract | ||
|---|---|---|
To measure the difference between two intersecting families F, G ⊆ 2([n]) we introduce the quantity D(F,G) = /{(F, G) : F ∈ F, G ∈ G, F ∧ G = 0}/. We prove that if F is k-uniform and G is l-uniform, then for large enough n and for any i &NOTEQUAL; j F-i = {F ⊆ C [n] : i ∈ F, /F/ = k} and F-j = {F ⊆ [n] : j ∈ F, /F/ = l} form an optimal pair of families (that is D(F, G) ≤ D(F-i, F-j) for all uniform and intersecting F and G), while in the non-uniform case any pair of the form F-i = {F ⊆ [n] : i ∈ F} and F-j = {F ⊆ [n] : j ∈ F} is optimal for any n. |
Year | Venue | Field |
|---|---|---|
2005 | ELECTRONIC JOURNAL OF COMBINATORICS | Discrete mathematics,Combinatorics,Mathematics |
DocType | Volume | Issue |
Journal | 12.0 | 1.0 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
0 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balázs Patkós | 1 | 85 | 21.60 |