arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.15812math.CO
收藏

在预算约束下构建具有高最小度的图

Building graphs with high minimum degree on a budget

Kyriakos Katsamaktsis, Shoham Letzter

AI总结:

本文针对受控随机图过程中构建高最小度图的问题,推翻了少用εn条边的策略必高概率失败的猜想,证明k≥2时存在少买n/9条边仍高概率成功的策略,k=1时则存在成败概率均有非零下界的策略。

摘要:

我们研究在Frieze、Krivelevich和Michaeli近期提出的受控随机图过程中,构建最小度$k\ge 1$的图的问题。假设$n$个顶点的完全图的边被均匀随机排列。玩家Builder逐条查看这些边,且在看到每条边时必须不可撤销地决定是否购买该边。\n 假设Builder当且仅当她的图中至少有一个端点的度数小于$k$时才购买边。Frieze、Krivelevich和Michaeli观察到,该策略能在$\tau_k$(即达到最小度$k$的击中时间)之前成功构建出最小度至少为$k$的图。他们推测,任何少用$\varepsilon n$条边(其中$\varepsilon>0$为任意常数)的策略,都将以高概率失败。\n 在本文中我们推翻了这一猜想。我们证明,当$k\ge 2$时,Builder存在一种策略,可少购买$n/9$条边,且能以高概率在$\tau_k$之前成功构建最小度至少为$k$的图。对于$k=1$的情况,我们证明任何少用$\varepsilon n$条边的策略失败的概率有非零下界,同时给出了一个成功概率有非零下界的此类策略。

英文摘要:

We consider the problem of constructing a graph of minimum degree $k\ge 1$ in the following controlled random graph process, introduced recently by Frieze, Krivelevich and Michaeli. Suppose the edges of the complete graph on $n$ vertices are permuted uniformly at random. A player, Builder, sees the edges one by one, and must decide irrevocably upon seeing each edge whether to purchase it or not. Suppose Builder purchases an edge if and only if at least one endpoint has degree less than $k$ in her graph. Frieze, Krivelevich and Michaeli observed that this strategy succeeds in building a graph of minimum degree at least $k$ by $τ_k$, the hitting time for having minimum degree $k$. They conjectured that any strategy using $εn$ fewer edges, where $ε>0$ is any constant, fails with high probability. In this paper we disprove their conjecture. We show that for $k\ge 2$ Builder has a strategy which purchases $n/9$ fewer edges and succeeds with high probability in building a graph of minimum degree at least $k$ by $τ_k$. For $k=1$ we show that any strategy using $εn$ fewer edges fails with probability bounded away from 0, and exhibit such a strategy that succeeds with probability bounded away from 0.

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

↑