The induced-matching bound for connected graphs beyond C_5^2 and K_3,3^+
Statement
Let be a connected graph with maximum degree . Let be the graph obtained from a -cycle by replacing its vertices with independent sets of order , and let be the graph obtained from by subdividing exactly one edge once. Write for the number of vertices, and let denote the maximum size of an induced matching in . The induced-matching bound conjecture. If , then
The conjecture is motivated by a theorem giving this bound for sufficiently large maximum degree and by the exceptional graphs and , which show that the corresponding theorem cannot extend unchanged to maximum degree three or four. Its validity for all connected graphs satisfying the stated hypotheses 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.