arXiv (All)
open access
The Margolis-Rhodes Monoid of a Graph
We investigate the structural, combinatorial, ideal-theoretic and Krohn-Rhodes complexity of the Margolis-Rhodes monoid, MR(G), of a finite simple graph G, viewed topologically as a 1-dimensional simplicial complex. Alongside the full monoid, we examine some subsemigroups including St(G), defined by
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimally pseudorandom $K_4$-free graphs#1116792
- A linear bound for nested cycles without geometric crossings#985258
- The scramble number of outerplanar graphs#1110329
- Topology-Driven Ordering of Flocking Matter#983836
- Noetherian forms of free non-symmetric operads#997373
Record · ID 1144337
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive