High-girth approximation conjecture for uniquely restricted matching number
Statement
For a graph , let denote its matching number and its uniquely restricted matching number. For every positive real number and every positive integer , consider graphs of maximum degree at most and girth at least . High-girth approximation conjecture. There is some positive integer such that
for every graph of maximum degree at most and girth at least . The conjecture asserts that, for fixed maximum degree, sufficiently large girth makes the uniquely restricted matching number asymptotically as close as desired to the ordinary matching number; the source gives no resolution, so it remains open.
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.