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

乘积图中的等周问题

Isoperimetry in product graphs

Sahar Diskin, Wojciech Samotij

AI总结:

本文为任意乘积图建立了一个紧的边等周不等式,该不等式在超立方体等情形下刻画了最小边边界,并改进与回答了正则图乘积的已有结果。

摘要:

在这篇短文中,我们为任意乘积图建立了一个边等周不等式。我们的不等式对于每个乘积图中许多不同大小的子集都是紧的。特别地,它意味着超立方体中具有最小边边界的 $2^d$ 元素集合是子立方体,并且仅略弱于 Bollobás–Leader 关于网格和环面的边等周不等式。此外,它改进了 Erde、Kang、Krivelevich 和第一作者证明的关于正则图乘积的两个边等周不等式,并回答了他们在工作中提出的关于正则图幂的边等周问题的两个问题。

英文摘要:

In this short note, we establish an edge-isoperimetric inequality for arbitrary product graphs. Our inequality is sharp for subsets of many different sizes in every product graph. In particular, it implies that the $2^d$-element sets with smallest edge-boundary in the hypercube are subcubes and is only marginally weaker than the Bollobás$\unicode{x2013}$Leader edge-isoperimetric inequalities for grids and tori. Additionally, it improves two edge-isoperimetric inequalities for products of regular graphs proved by Erde, Kang, Krivelevich, and the first author and answers two questions about edge-isoperimetry in powers of regular graphs raised in their work.

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

↑