The caterpillar maximum-center neighbor conjecture
Statement
Let be a caterpillar, let , and let a maximum -center be a vertex maximizing the number of independent -sets containing it. Caterpillar center-neighbor conjecture. If is a maximum -center, then the neighbor of has maximum degree. The text presents this as a conjecture following partial results on maximum -centers in caterpillars; its general validity is not resolved in the supplied source.
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.