Abstract:We first characterise graphs with binomial edge ideals of König type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply known results in the field to binomial edge ideals.
In particular, we show that cocomparability graphs have binomial edge ideals of König type, settling a question of LaClair and McCullough [arXiv:2601.15403, Question 10.5], and without requiring their unmixedness hypothesis.
Along with their work, this allows us to classify unmixed binomial edge ideals of König type as precisely those for which the underlying graph is cocomparability, or, in the language of Matsuda [Weakly Closed Graphs and F-Purity of Binomial Edge Ideals, 2018], weakly closed.
We then conjecture that AT-free graphs have binomial edge ideals of König type.
| Comments: | 7 pages |
| Subjects: | Commutative Algebra (math.AC) |
| MSC classes: | 13C70 (Primary) 05C75, 05E40, 13F65 (Secondary) |
| Cite as: | arXiv:2605.24933 [math.AC] |
| (or arXiv:2605.24933v1 [math.AC] for this version) | |
| https://doi.org/10.48550/arXiv.2605.24933 arXiv-issued DOI via DataCite (pending registration) |
From: David Williams [view email]
[v1]
Sun, 24 May 2026 08:25:36 UTC (13 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。