Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Address:
1
0
0
The Krohn-Rhodes complexity of graph monoids reveals a sharp threshold for cycles and paths, with MR(G) becoming complexity 2 for cycles $\ge 4$ and paths $\ge 13$.