Graph partitions under average degree constraint

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2023-12-05 DOI:10.1016/j.jctb.2023.11.006

Yan Wang , Hehui Wu

引用次数: 0

Abstract

In this paper, we prove that every graph with average degree at least $s + t + 2$ 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.

查看原文本刊更多论文

平均度约束下的图分区

本文证明了每一个平均度至少为s+t+2的图都有一个顶点划分成两部分，使得一部分的平均度至少为s，另一部分的平均度至少为t。这就解决了Csóka、Lo、Norin、Wu和Yepremyan的一个猜想。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Theory Series B 数学-数学

CiteScore

2.70

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.