Matching sequencibility conjecture for complete multi-partite graphs
Statement
Let be the complete -partite graph with each part of size . For an ordering of the edges, let denote matching sequencibility, and let denote cyclic matching sequencibility.
Matching sequencibility conjecture. For any integers and ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.