arXiv (OAI Expanded)
open access
Hall algebras of graphs and rooted trees
Hall algebras can be associated with a broad class of combinatorial structures through the theory of 2-Segal sets. In this paper, we study the Hall algebras arising from the 2-Segal sets of rooted trees, undirected graphs, and directed graphs. In each case, we establish an analogue of Green's theore
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
- Sub-quorum colorings of some infinite families of caterpillars#1144586
- Proper edge colorings of planar graphs with rainbow $C_4$-s#793392
- Proper edge colorings of planar graphs with rainbow $C_4$-s#789388
- Proof-Theoretic Relations between Higman's and Kruskal's theorem, and Independence Results for Tree-like Structures#684299
- Proof-Theoretic Relations between Higman's and Kruskal's theorem, and Independence Results for Tree-like Structures#682524
Record · ID 1122842
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