ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let w=(α1,…,α2n)w=(\alpha_1,\dots,\alpha_{2n}) be a conf-connected word, let aa be its minimal letter, and let Iw(a)I_w(a) denote the positions occupied by aa. Set

i=max⁡(Iw(a)),j=max⁡(Iw(a+2)).i=\max(I_w(a)),\qquad j=\max(I_w(a+2)).

Let w˚{(i,j)}\mathring{w}_{\{(i,j)\}} be the word obtained by deleting the letters in positions ii and jj. The conf-connected deletion conjecture. The word w˚{(i,j)}\mathring{w}_{\{(i,j)\}} is conf-connected.

The statement is proposed as a combinatorial route toward the degeneracy-graph connectivity conjecture. The paper does not provide a proof or 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.