Intermediate matching number conjecture for tree degree sequences
Statement
Let be a tree degree sequence of length , and let denote the trees with degree sequence . Write and for the minimum and maximum matching numbers among these trees.
Intermediate matching number conjecture. For every positive integer satisfying
there exists a tree such that .
This asserts that the matching numbers realized by trees with a fixed degree sequence contain every integer between the minimum and maximum values. The supplied text gives no evidence of 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.