arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2512.08020math.CO
收藏

关于阿伯拉森猜想的进展

Progress on Albertson's Conjecture

College of William & Mary(威廉与玛丽学院)

Daniel W. Cranston

AI总结:

本文验证了阿伯拉森猜想在r≤24时的成立,并限制了r=25、26时反例的可能性,同时扩展了最小反例阶数的排除范围。

摘要:

阿伯拉森猜想提出,每个色数为r的图的交叉数至少等于完全图K_r的交叉数。该猜想在r≤12时由阿伯拉森、克兰斯顿和福克斯证明;在r≤16时由巴拉特和托斯证明;在r≤18时由阿克曼证明。本文验证了r≤24的情况;我们还大大限制了r∈{25,26}时反例的可能性。此外,我们加强了先前工作对每个r选择的最小反例阶数的上界:我们排除了|G|≥2.82r的可能性,并排除了1.228r≤|G|≤1.768r的可能性。最后,随着r的增长,我们扩展了最小反例阶数的排除范围的下限。特别是:如果r≥125,000,则排除了1.10r≤|G|≤1.768r的可能性;如果r≥825,000,则排除了1.05r≤|G|≤1.768r的可能性。

英文摘要:

Albertson conjectured that every graph with chromatic number $r$ has crossing number at least the crossing number of the complete graph $K_r$. This conjecture was proved for $r\le 12$ by Albertson, Cranston, and Fox; for $r\le 16$ by Barát and Tóth; and for $r\le 18$ by Ackerman. Here we verify it for $r\le 24$; we also greatly restrict the possibilities for counterexamples when $r\in\{25,26\}$. In addition, we strengthen earlier work bounding the order of a minimum counterexample for each choice of $r$: we exclude the possibility that $|G|\ge 2.82r$ and exclude the possibility that $1.228r\le |G|\le 1.768r$. Finally, as $r$ grows, we extend the lower end of this range of excluded orders for a minimum counterexample. In particular: if $r\ge 125{,}000$, then we exclude the possibility that $1.10r\le |G|\le 1.768r$; and if $r\ge 825{,}000$, then we exclude the possibility that $1.05r\le |G|\le 1.768r$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑