ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let s\mathbf{s} be a tree degree sequence of length n>2n>2, and let Ts\mathcal{T}_{\mathbf{s}} denote the trees with degree sequence s\mathbf{s}. Write νm(Ts)\nu_m(\mathcal{T}_{\mathbf{s}}) and νM(Ts)\nu_M(\mathcal{T}_{\mathbf{s}}) for the minimum and maximum matching numbers among these trees.

Intermediate matching number conjecture. For every positive integer kk satisfying

νm(Ts)≤k≤νM(Ts),\nu_m(\mathcal{T}_{\mathbf{s}})\leq k\leq\nu_M(\mathcal{T}_{\mathbf{s}}),

there exists a tree T∈TsT\in\mathcal{T}_{\mathbf{s}} such that ν(T)=k\nu(T)=k.

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 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.