The conf-connected deletion conjecture
Statement
Let be a conf-connected word, let be its minimal letter, and let denote the positions occupied by . Set
Let be the word obtained by deleting the letters in positions and . The conf-connected deletion conjecture. The word 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.