关于随机3-正则图的最小二等分
On the minimum bisection of random $3$-regular graphs
AI总结:
该研究针对随机3-正则图的最小二等分宽度问题,通过一阶矩法与图结构分析得到0.103295n的新下界,结合已有结果与组合洞见得到0.139822n的上界,还借助蒙特卡洛模拟得到非严格改进上界,推进了相关经典结果。
摘要:
本文给出了n个顶点的随机3-正则图二等分宽度的新界。主要贡献是结合一阶矩方法与图的结构分析,得到了0.1003295n的新下界,改进了Kostochka和Melnikov沿用27年的结果。我们还结合Lyons的结果与原创组合洞见,给出了0.139822n的互补上界。进一步发展该方法后,我们借助Monte Carlo模拟得到了一个非严格的改进上界。
英文摘要:
In this paper we give new bounds on the bisection width of random 3-regular graphs on $n$ vertices. The main contribution is a new lower bound of $0.103295n$ based on a first moment method together with a structural analysis of the graph, thereby improving a 27-year-old result of Kostochka and Melnikov. We also give a complementary upper bound of $0.139822n$ by combining a result of Lyons with original combinatorial insights. Developping this approach further, we obtain a non-rigorous improved upper bound with the help of Monte Carlo simulations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。