具有独立性为2的图的密集子图

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2025-09-17 DOI:10.1016/j.jctb.2025.08.005

Sergey Norin , Paul Seymour

引用次数: 0

摘要

根据Hadwiger的猜想，我们证明了每一个没有大小为3的独立集的图都包含一个具有0.98688⋅(t2)−o（t2）条边的t顶点简单小图，其中t为其色数。

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

查看原文本刊更多论文

Dense minors of graphs with independence number two

Motivated by Hadwiger's conjecture, we prove that every graph with no independent set of size three contains a t-vertex simple minor with

0.98688 \cdot (\begin{matrix} t \\ 2 \end{matrix}) - o (t^{2})

edges, where t is its chromatic number.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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.