当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Graph partitions under average degree constraint
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2023-12-05 , DOI: 10.1016/j.jctb.2023.11.006 Yan Wang , Hehui Wu
中文翻译:
平均度约束下的图划分
更新日期:2023-12-05
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2023-12-05 , DOI: 10.1016/j.jctb.2023.11.006 Yan Wang , Hehui Wu
In this paper, we prove that every graph with average degree at least has a vertex partition into two parts, such that one part has average degree at least s, and the other part has average degree at least t. This solves a conjecture of Csóka, Lo, Norin, Wu and Yepremyan.
中文翻译:
![](https://scdn.x-mol.com/jcss/images/paperTranslation.png)
平均度约束下的图划分
在本文中,我们证明每个具有平均度的图至少顶点划分为两部分,其中一部分的平均度数至少为s,另一部分的平均度数至少为t。这解决了 Csóka、Lo、Norin、Wu 和 Yepremyan 的猜想。