The 7/18 bound conjecture for minimum maximal matchings in cubic graphs
Statement
Let be a connected cubic graph of order .
The 7/18 bound conjecture.
The source gives for the asymptotic infimum of over connected cubic graphs and suspects that .
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.