ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let η,d\eta,d be positive integers. Let GG be a K1,dK_{1,d}-free graph, and let α-tw⁡(G)\operatorname{\alpha\text{-}\mathsf{tw}}(G) denote its tree-independence number. A set SS is a separator between two vertex sets if deleting SS separates them; α(S)\alpha(S) denotes the independence number of the subgraph induced by SS.

Two induced cycles conjecture. There exists a function f:N2→Nf:\mathbb{N}^2\rightarrow\mathbb{N} such that every K1,dK_{1,d}-free graph GG with α-tw⁡(G)≥f(η,d)\operatorname{\alpha\text{-}\mathsf{tw}}(G)\geq f(\eta,d) contains two induced cycles C1,C2C_1,C_2 such that C1C_1 and C2C_2 are non-adjacent, and every separator SS between C1C_1 and C2C_2 satisfies α(S)≥η\alpha(S)\geq\eta.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.