arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.01394math.CO
收藏

完成和不足问题

Completion and deficiency problems

Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner

摘要:

给定一个阶为$n$的部分Steiner三元系(STS),它可以嵌入的最小完备STS的阶是多少?对这个问题的研究可以追溯到40多年前。在本文中,我们回答它相对稀疏的STS,表明,给定一个部分STS的顺序$n$与最多$r \le \varepsilon n^2$三元组,它总是可以嵌入到一个完整的STS顺序$n+O(\sqrt{r})$,这是渐近最优的。我们也得到了类似的结果,拉丁广场和其他设计的完成。这就提出了一种新的、自然的问题,称为缺陷问题。给定全局生成性质$\mathcal{P}$和图$G$,定义图$G$关于性质$\mathcal{P}$的亏数为最小正整数$t$,使得连接$G\ast K_t$具有性质$\mathcal{P}$ .为了说明这一概念,我们考虑一些研究得很好的性质,如有一个$K_k$ -分解,哈密尔顿性,有一个三角形的因素,并有一个完美的超图匹配的不足版本。本文的主要目的是提出一个系统的研究这些问题,从而也给出了几个未来的研究方向。

英文摘要:

Given a partial Steiner triple system (STS) of order $n$, what is the order of the smallest complete STS it can be embedded into? The study of this question goes back more than 40 years. In this paper we answer it for relatively sparse STSs, showing that given a partial STS of order $n$ with at most $r \le \varepsilon n^2$ triples, it can always be embedded into a complete STS of order $n+O(\sqrt{r})$, which is asymptotically optimal. We also obtain similar results for completions of Latin squares and other designs. This suggests a new, natural class of questions, called deficiency problems. Given a global spanning property $\mathcal{P}$ and a graph $G$, we define the deficiency of the graph $G$ with respect to the property $\mathcal{P}$ to be the smallest positive integer $t$ such that the join $G\ast K_t$ has property $\mathcal{P}$. To illustrate this concept we consider deficiency versions of some well-studied properties, such as having a $K_k$-decomposition, Hamiltonicity, having a triangle-factor and having a perfect matching in hypergraphs. The main goal of this paper is to propose a systematic study of these problems; thus several future research directions are also given.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑