Acyclic matching bound for connected subcubic graphs
Statement
Let be a connected subcubic graph, let denote its number of vertices, and let denote its acyclic matching number. The acyclic matching conjecture. There is a constant such that
for every connected subcubic graph . The conjecture would be asymptotically best possible, as the paper describes a family of connected subcubic graphs satisfying ; its resolution is not indicated here.
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.