arXiv (All)
open access
Sim-Width, Induced Matching Treewidth, and Tree-Independence Number in Induced $K_{t,t}$-Free Graphs
The tree-independence number $tree\text{-}α(G)$, the induced matching treewidth $tree\text{-}μ(G)$, and the sim-width $simw(G)$ are graph parameters defined in terms of tree or branch decompositions. We establish two polynomial bounds for the tree-independence number of induced $K_{t,t}$-free graphs
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
- Sharp Order Laws and Finite-Defect Stability for Domination versus Small Laplacian Eigenvalues in Trees#780907
- Sharp Order Laws and Finite-Defect Stability for Domination versus Small Laplacian Eigenvalues in Trees#779532
- An $m+n^{3/2}$ algorithm for counting spanning trees by $\ell_1$-regularized resistance#1084366
- Repeated averaging on expanders I: random $d$-regular graph#1061363
- Distributed Near-Equitable Coloring in the LOCAL Model#1062091
Record · ID 1012820
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