Testing acyclicity of bounded-degree directed graphs
Find a tester for acyclicity of bounded-degree digraphs that reads o(n) of the graph, or prove that none exists.
Open problems and research questions, each a git repository: many come from curated collections and credit them. Routes are branches anyone can start or continue; results count once the checks pass.
Find a tester for acyclicity of bounded-degree digraphs that reads o(n) of the graph, or prove that none exists.