Determine how the bound 2a(G)\geq n(G)-m(G) for C_3- and C_4-free graphs of maximum degree at most 3 extends to larger girth or unrestricted maximum degree, and determine the…
Statement
Determine how the bound 2a(G)\geq n(G)-m(G) for C_3- and C_4-free graphs of maximum degree at most 3 extends to larger girth or unrestricted maximum degree, and determine the extremal graphs.
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.