Baste–Fürst–Henning–Mohr–Rautenbach bound for minimum maximal matchings
Statement
Let be a connected -regular graph of order for some .
Baste–Fürst–Henning–Mohr–Rautenbach conjecture.
This conjecture concerns the edge domination number of connected regular graphs and would give a sharp general upper bound for minimum maximal matchings.
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.