加载中…
We give a combinatorial characterisation of connected graphs whose binomial edge ideals are of König type, developed independently to the similar characterisation given by LaClair in arXiv:2304.13299, and exhibit some classes of graphs satisfying our criteria. For any connected Hamiltonian graph on vertices, we compute an explicit root of as an -finite -module.

生成讲解博客的中文版本

生成AI智能校验的中文版本