TxGraffiti's independence–matching conjecture for regular graphs
Statement
Let be a connected -regular graph with . Let denote the independence number of , and let denote its matching number. TxGraffiti's independence–matching conjecture. Then
and this bound is sharp. This is a generalized form of the example conjecture produced by the filtering heuristic, illustrating how a more general graph hypothesis can be retained for the same sharp inequality.
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.