Proof of a conjecture of Fomichev and Karev
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 sl(2)-weight system of its 2-dimensional irreducible representation.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.