Reproduce “Counting $6$-Cliques in $O(n^{5.97})$ time and $O(\log n)$ space” 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

Afrouz Jabal Ameli, Niklas Mohrin, Jesper Nederlof

The authors give an algorithm for counting six-vertex cliques in an n-vertex graph with read-only random access to its adjacency matrix. It expands pair-matching conditions into cases and evaluates each using the cheaper of two low-memory methods. The algorithm runs in O(n^5.97) time using O(log n) space, a theoretical bound rather than a measured practical speedup.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.