Bounded sim-width and tree-independence conjecture
Statement
For every pair of integers and , there exists a constant such that every graph with no induced subgraph isomorphic to and satisfying also satisfies . Equivalently, for each fixed , bounded sim-width in the class of induced -free graphs implies bounded tree-independence number.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.