arXiv (All)
open access
Modularity of minor-free graphs
We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.
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
- Distributed Lower Bounds via Automatic Self-Reduction#1129011
- Distributed Lower Bounds via Automatic Self-Reduction#1108707
- Deletion versus alteration in finite structures#490250
- The Erdős-Gallai bound for consecutive even cycle lengths#974579
- Unbalanced Turán and spectral Turán problems with prescribed large maximum degree#1116407
Record · ID 820111
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