The odd induced subgraph conjecture
Statement
Let be a graph without isolated vertices. Call an induced subgraph of odd if all of its degrees are odd, and let denote the maximum order of an odd induced subgraph of .
Odd induced subgraph conjecture. There exists a constant such that for every graph without isolated vertices,
Scott proved the bound , which establishes the conjecture for graphs of bounded chromatic number. The conjecture is also known for trees and graphs of maximum degree ; this paper confirms it for graphs of treewidth at most two with , and shows that this bound is best possible for that class.
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.