arXiv (All)
open access
Extremal Spanning Trees in Product Grid Graphs
We compare spanning-tree counts at a fixed number of vertices for Cartesian products of paths $P_r$, $r\ge1$, or cycles $C_s$, $s\ge3$. With the number $d$ of factors fixed, an equal-volume tuple that is more balanced in the logarithmic majorization order has at least as many spanning trees, with eq
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
- Clique Number of Tournaments II#984399
- Subquadratic-Query Algorithms for Finding Another Maximum Matroid Intersection#1011893
- Counting $t$-wise $L$-intersecting cliques with prescribed intersection sizes#1037076
- Local decisions, diffusive influence, and lower bounds for graphical balanced allocation#1143327
- The maximum number of maximal dissociation sets in trees#625210
Record · ID 1117479
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