paper

Proof of a conjecture of Fomichev and Karev

arXiv:2510.27279

Abstract

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.

6pages