加载中…
We prove a conjecture of Fomichev and Karev [{European J. Combin.} 127 (2025) 104160] by showing the equality of two graph invariants: , defined via graph colorings, and , derived from the -weight system of its 2-dimensional irreducible representation.

生成讲解博客的中文版本

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