The two induced cycles conjecture for K_1,d-free graphs
Statement
Let be positive integers. Let be a -free graph, and let denote its tree-independence number. A set is a separator between two vertex sets if deleting separates them; denotes the independence number of the subgraph induced by .
Two induced cycles conjecture. There exists a function such that every -free graph with contains two induced cycles such that and are non-adjacent, and every separator between and satisfies .
This conjecture would provide an analogue of the paper's path-and-cycle connectivity result with two induced cycles, potentially supporting the double-wheel program. The paper presents it as a possible next step and gives no resolution.
Record
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.