Indivisibility for classes of graphs

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2025-07-29 DOI:10.1016/j.disc.2025.114703

Vincent Guingona , Felix Nusbaum , Zain Padamsee , Miriam Parnes , Christian Pippin , Ava Zinman

引用次数: 0

Abstract

We examine indivisibility for classes of graphs. We show that the class of hereditarily α-sparse graphs is indivisible if and only if

α > 2

. Additionally, we show that the following classes of graphs are indivisible: perfect graphs, cographs, and chordal graphs, and the following classes of graphs are not indivisible: threshold graphs, split graphs, and distance-hereditary graphs.

查看原文本刊更多论文

图类的不可分性

我们研究图类的不可分性。证明了一类遗传α-稀疏图当且仅当α>；2是不可分的。此外，我们还证明了以下几类图是不可分的：完全图、图和弦图，以及以下几类图是不可分的：阈值图、分裂图和距离遗传图。

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

求助全文

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

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.