Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let $E_1 ,\cdots,E_m $ be subsets of a set V of size n, such that each element of V is in at most k of the $E_i $ and such that each collection of t sets from $E_1 ,\cdots ,E_m $ has a system of distinct representatives (SDR). It is shown that $m/n\leqq (k(k - 1)^r - k)/(2(k - 1)^r - k)$ if $t = 2r - 1$, and $m/n \leqq (k(k - 1)^r - 2)/(2(k - 1)^r - 2)$ if $t = 2r$. Moreover it is shown that these upper bounds are the best possible. From these results the “worst-case ratio” of certain heuristics for the problem of finding a maximum collection of pairwise disjoint sets among a given collection of sets of size k is derived.
['Cor A. J. Hurkens', 'Alexander Schrijver']
I am writing a research paper on a idea On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems
[{"from": "human", "value": "I am writing a research paper on a idea On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let $E_1 ,\\cdots,E_m $ be subsets of a set V of size n, such that each element of V is in at most k of the $E_i $ and such that each collection of t sets from $E_1 ,\\cdots ,E_m $ has a system of distinct representatives (SDR). It is shown that $m/n\\leqq (k(k - 1)^r - k)/(2(k - 1)^r - k)$ if $t = 2r - 1$, and $m/n \\leqq (k(k - 1)^r - 2)/(2(k - 1)^r - 2)$ if $t = 2r$. Moreover it is shown that these upper bounds are the best possible. From these results the \u201cworst-case ratio\u201d of certain heuristics for the problem of finding a maximum collection of pairwise disjoint sets among a given collection of sets of size k is derived."}]