关于一个与组合批码有关的极值超图问题
On an Extremal Hypergraph Problem Related to Combinatorial Batch Codes
摘要:
令$n, r, k$是正整数,使得$3\leq k < n$和$2\leq r \leq k-1$。设$m(n, r, k)$表示$r$ -一致超图在$n$顶点上所能拥有的最大边数,条件是$i$边的任何集合对于所有$1 \leq i \leq k$至少跨越$i$顶点.我们感兴趣的是固定$r$和$k$为$n \rightarrow \infty$的$m(n, r, k)$的渐近性质。这个问题与Brown、Erdés和Sós提出的禁止超图问题有关,最近在组合批处理码的背景下讨论过。在这篇简短的论文中,我们得到了以下结果。{enumerate}[(i)]使用Erdos的结果,我们能够显示$7\leq k$和$3 \leq r \leq k-1-\lceil\log k \rceil$的$m(n, k, r) = o(n^r)$。这一结果是最好的可能性方面的上限$r$,因为我们随后通过明确的建设,$6 \leq k$,和$k-\lceil \log k \rceil \leq r \leq k-1, m(n, r, k) = Θ(n^r)$。这种明确的建设改善了非建设性的一般下界布朗,Erdés,和Sós所考虑的参数值。对于2-均匀CBCs,我们得到以下结果。{enumerate}我们为$n \geq 5$提供$m(n, 2, 5)$的精确值。利用Lazebnik等人关于具有大围长的图的最大尺寸的一个结果,我们改进了现有的关于$m(n, 2, k)$($Ω(n^{\frac{k+1}{k-1}})$)的下界,它适用于所有的$k \geq 8$和无穷多个$n$值.我们使用Bondy和Simonovits的结果证明了$m(n, 2, k) = O(n^{1+\frac{1}{\lfloor\frac{k}{4}\rfloor}})$,并使用Kövari,Sós和Turán的结果证明了$k = 6, 7, 8$的$m(n, 2, k) = Θ(n^{3/2})$。
英文摘要:
Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges, span at least $i$ vertices for all $1 \leq i \leq k$. We are interested in the asymptotic nature of $m(n, r, k)$ for fixed $r$ and $k$ as $n \rightarrow \infty$. This problem is related to the forbidden hypergraph problem introduced by Brown, Erdős, and Sós and very recently discussed in the context of combinatorial batch codes. In this short paper we obtain the following results. {enumerate}[(i)] Using a result due to Erdős we are able to show $m(n, k, r) = o(n^r)$ for $7\leq k$, and $3 \leq r \leq k-1-\lceil\log k \rceil$. This result is best possible with respect to the upper bound on $r$ as we subsequently show through explicit construction that for $6 \leq k$, and $k-\lceil \log k \rceil \leq r \leq k-1, m(n, r, k) = Θ(n^r)$. This explicit construction improves on the non-constructive general lower bound obtained by Brown, Erdős, and Sós for the considered parameter values. For 2-uniform CBCs we obtain the following results. {enumerate} We provide exact value of $m(n, 2, 5)$ for $n \geq 5$. Using a result of Lazebnik,et al. regarding maximum size of graphs with large girth, we improve the existing lower bound on $m(n, 2, k)$ ($Ω(n^{\frac{k+1}{k-1}})$) for all $k \geq 8$ and infinitely many values of $n$. We show $m(n, 2, k) = O(n^{1+\frac{1}{\lfloor\frac{k}{4}\rfloor}})$ by using a result due to Bondy and Simonovits, and also show $m(n, 2, k) = Θ(n^{3/2})$ for $k = 6, 7, 8$ by using a result of Kövari, Sós, and Turán.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。