Reproduce “Transfer of Weisfeiler-Leman equivalence under graph operations” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Dmitriy Kunisky, Hamilton Sawczuk
The authors determine the least Weisfeiler–Leman (WL) input level that guarantees equivalent outputs after taking line graphs. They define this transfer threshold through homomorphism counts from probe graphs of bounded treewidth, and prove matching upper and lower bounds. For every k≥2, the threshold is 2k+1; for k=1, it is 1. This is a worst-case guarantee for finite simple graphs, not evidence of practical performance gains.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.