Dice Question Streamline Icon: https://streamlinehq.com

Completeness of 3-WL for distinguishing all 3D graphs

Establish whether the 3-dimensional Weisfeiler–Lehman (3-WL) test distinguishes all non-isomorphic 3D graphs by either proving completeness or providing a counterexample of two non-isomorphic 3D graphs that receive identical labels under 3-WL.

Information Square Streamline Icon: https://streamlinehq.com

Background

While the authors argue that 3-FWL can generate a unique 3D graph and hence distinguish all 3D graphs, they do not have a comparable proof for 3-WL. The paper proposes an “edge equality analysis” framework to paper 3-WL but reports no definitive resolution.

The explicit lack of a proof or counterexample leaves open whether 3-WL is complete for 3D graph isomorphism, a central question for the practical and theoretical utility of WL-based methods in geometric settings.

References

So far, we have not found an effective way to prove that 3-WL can distinguish all 3D graphs, nor have we found a counterexample.

Is 3-(F)WL Enough to Distinguish All 3D Graphs? (2402.08429 - Xu, 24 Jan 2024) in Subsection “Future work” under Section “Does 3-WL have tricks?”