Exceptional-case strengthening of the subcubic minimum maximal matching bound
Statement
Let be a connected subcubic graph with vertices and edges.
Subcubic bound conjecture.
unless is isomorphic to the complete graph or the complete bipartite graph .
This is proposed as a minor strengthening of the paper's subcubic bound, with the two listed graphs as exceptions.
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.