arXiv (All)
open access
Clique-dependent strongly sublinear treewidth and strongly sublinear tree-independence number
We establish a strongly sublinear counterpart of a recent result of Chudnovsky, E S, and Lokshtanov (arXiv 2025) on treewidth and tree-independence number. Namely, we prove that a hereditary graph class has strongly sublinear tree-independence number if and only if, for every fixed clique bound, its
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
- Bounded Independence Edge Subsampling in Graphs#347579
- Localization of the Caro-Wei bound and its applications to bipartiteness#819673
- Localization of the Caro-Wei bound and its applications to bipartiteness#809677
- The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma#662472
- The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma#661422
Record · ID 1051089
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