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

在预算约束下的随机图过程中构造小子图

On constructing small subgraphs in the budget-constrained random graph process

Adam Mickiewicz University(亚当·密茨凯维奇大学);Universitat de Barcelona (UB)(巴塞罗那大学);Institute of Science and Technology Austria (ISTA)(奥地利科学技术研究所);University of Novi Sad(诺维萨德大学)

Sylwia Antoniuk, Alberto Espuny Díaz, Kalina Petrova, Miloš Stojaković

AI总结:

研究在预算约束下构造包含特定小子图的随机图过程,确定构造K4的最优预算条件并解决相关问题。

摘要:

考虑由Frieze、Krivelevich和Michaeli引入的预算约束随机图过程,其中每次通过标准随机图过程提供一条边时,我们必须不可撤销地决定是否“购买”这条边,我们的目标是在给定时间t内构造一个满足某些性质的图,同时购买的边数不超过b。我们考虑构造包含某些固定小子图的图的问题。我们为构建包含K4副本的图提供了最优策略,证明预算b=ω(max{n^8/t^5,n^2/t})足够,并且如果b=o(max{n^8/t^5,n^2/t}),则没有策略能几乎肯定地产生包含K4副本的图。这解决了Iľkovič、León和Shu提出的问题。更一般地,我们对包含任何固定大小的轮状图或由树加一个额外的全连接顶点构成的图,获得了类似精确的结果。我们还处理了构造包含K5副本的图的问题,获得了最优预算的上下界,但在此情况下仍存在差距。

英文摘要:

Consider the budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli, where each time an edge is offered through the (standard) random graph process we must irrevocably decide whether to "purchase" this edge or not, with our goal being to construct a graph which satisfies some property within a given time $t$ and while purchasing at most $b$ edges. We consider the problem of constructing graphs containing certain fixed small subgraphs. We provide an optimal strategy for building a graph which contains a copy of $K_4$, showing that budget $b=ω(\max\{n^8/t^5,n^2/t\})$ suffices and that if $b=o(\max\{n^8/t^5,n^2/t\})$ then no strategy can a.a.s. produce a graph containing a copy of $K_4$. This resolves a problem raised by Iľkovič, León and Shu. More generally, we obtain analogously tight results for containing a wheel of any fixed size, or a graph consisting of a tree plus one additional universal vertex. We also tackle the problem of constructing graphs containing a copy of $K_5$, obtaining both lower and upper bounds on the optimal budget, though a gap remains in this case.

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

↑