ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Ks(n)K_{s(n)} be the complete ss-partite graph with each part of size nn. For an ordering of the edges, let msms denote matching sequencibility, and let cmscms denote cyclic matching sequencibility.

Matching sequencibility conjecture. For any integers n≥2n\geq 2 and s≥2s\geq 2,

ms(Ks(n))=cms(Ks(n))=⌊sn2⌋−1.ms(K_{s(n)})=cms(K_{s(n)})=\left\lfloor\frac{sn}{2}\right\rfloor-1.

This conjecture proposes an exact common value for the ordinary and cyclic matching sequencibility of complete equipartite graphs. The supplied text does not indicate whether it has been proved or disproved.

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.