arXiv (All)
open access
Tree-independence number of $P_5$-free graphs with no large bicliques
The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounde
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
- Computing the Helly Number, Radon Number and Rank in Cycle Convexity#1119309
- Competing bootstrap processes on the random graph $G(n,p)$#984796
- On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graphs#290500
- Majority Dynamics on Random Graphs With Almost Balanced Initial Settings: The Power of Few#656561
- Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter Tractable#1064381
Record · ID 1035482
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