arXiv (OAI Expanded)
open access
Matroids and isomorphism problems for Bestvina-Brady groups
We propose a factorization of the graph isomorphism problem for Bestvina-Brady groups (BBGs) through matroid theory. In particular, we show that finitely presented BBGs depend on their defining graphs only through their cycle matroids. On the other hand, we construct graphs of arbitrarily high conne
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
- Linear circumference in vertex-transitive graphs#1157401
- A Nine-Element Minor Theorem for 3-Connected Nonbinary Matroids with a W4-Minor#1065631
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#799562
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#798139
- On the lengths of MDS codes with a two-transitive permutation automorphism group#972228
Record · ID 1110708
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