ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G\mathbf{G} be the set of isomorphism classes of finite simple graphs. For G∈GG\in\mathbf{G}, let φ(G)\varphi(G) be the graph invariant defined by

φ(G)=2−3∣V(G)∣∑E′⊂E(G)(−2)∣E′∣χ3(G∣E′),\varphi(G)=2^{-3|V(G)|}\sum_{E'\subset E(G)}(-2)^{|E'|}\chi_3(G|_{E'}),

where χ3(G)\chi_3(G) is the number of proper vertex colorings of GG with three colors. Let

ψ(G)=122∣V(G)∣∑U⊂V(G)(−12)∣V(G)∣−∣U∣2corank⁡(A(G∣U)),\psi(G)=\frac{1}{2^{2|V(G)|}}\sum_{U\subset V(G)}\left(-\frac{1}{2}\right)^{|V(G)|-|U|}2^{\operatorname{corank}(A(G|_U))},

where G∣UG|_U is the induced subgraph on UU, A(G∣U)A(G|_U) is its adjacency matrix over the field with two elements, and corank⁡\operatorname{corank} denotes matrix corank. Fomichev–Karev conjecture. For every G∈GG\in\mathbf{G},

φ(G)=ψ(G).\varphi(G)=\psi(G).

Fomichev and Karev introduced these invariants in connection with graph Chmutov–Varchenko relations and the sl(2)\mathfrak{sl}(2)-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.