Fomichev–Karev conjecture on graph invariants
Statement
Let be the set of isomorphism classes of finite simple graphs. For , let be the graph invariant defined by
where is the number of proper vertex colorings of with three colors. Let
where is the induced subgraph on , is its adjacency matrix over the field with two elements, and denotes matrix corank. Fomichev–Karev conjecture. For every ,
Fomichev and Karev introduced these invariants in connection with graph Chmutov–Varchenko relations and the -weight system. The conjecture is proved in the paper, so it is no longer open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.