Berman–Wang–Wargo conjecture on odd induced subgraphs
Statement
Let be a connected simple graph of order , and let denote the maximum order of an induced subgraph in which every vertex has odd degree.
Berman–Wang–Wargo conjecture. For any connected simple graph of order ,
The conjecture is a proposed universal lower bound for connected graphs, but the source explicitly disproves it.
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.