The critical group of a clique-inserted graph

NEW

Problem: Reconstructed conjecture: for every connected finite simple non-bipartite $d$-regular graph $G$, with clique-inserted graph $C(G)$, critical group $K(\cdot)$, and $\beta(G)=|E(G)|-|V(G)|+1$, the Chen–Zhang map $f^*:K(C(G))\to K(G)$ satisfies

This is the natural reading because the right-hand side is a candidate kernel inside $K(C(G))$.

Result: The conjecture is false. Let $G=K_5$. Then $G$ is connected, non-bipartite, $4$-regular, and

The conjectured kernel is

so

But $K(K_5)$ has order $\tau(K_5)=5^3$, hence odd. Therefore every homomorphism

kills the entire Sylow $2$-subgroup of $K(C(K_5))$, so the $2$-rank of its kernel equals the $2$-rank of $K(C(K_5))$.

Now compute that rank. The vertices of $C(K_5)$ are ordered pairs $(i,j)$, $i\ne j$, with adjacency

There are $20$ vertices and the graph is $4$-regular, so over $\mathbb F_2$ its Laplacian equals its adjacency matrix $A$.

For $x=(x_{ij})\in\ker A$, set $s_i=\sum_{k\ne i}x_{ik}$. The equation $(Ax)_{ij}=0$ gives

Swapping $i,j$ gives $s_i=s_j$, so all $s_i=s$. Summing over all $i$,

hence $s=0$. Thus $x_{ij}=x_{ji}$, and the remaining condition is that the corresponding edge-labeling of $K_5$ has even degree at every vertex. This is the binary cycle space of $K_5$, of dimension

So $\operatorname{rank}_{\mathbb F_2}A=20-6=14$.

For a connected graph $X$,

Therefore

Hence any kernel $K(C(K_5))\to K(K_5)$ has $2$-rank $5$, while the conjectured group has $2$-rank $6$. Thus

Audit: $K_5$ satisfies all reconstructed hypotheses, and the contradiction is with the exact claimed isomorphism.

Citation: Context: Haiyan Chen and Fuji Zhang, “The critical group of a clique-inserted graph,” Discrete Mathematics 319 (2014), 24–32. The counterexample above is self-contained.