ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph without isolated vertices. Call an induced subgraph of GG odd if all of its degrees are odd, and let f(G)f(G) denote the maximum order of an odd induced subgraph of GG.

Odd induced subgraph conjecture. There exists a constant c>0c>0 such that for every graph GG without isolated vertices,

f(G)≥c∣V(G)∣.f(G)\geq c|V(G)|.

Scott proved the bound f(G)≥∣V(G)∣/(2χ(G))f(G)\geq |V(G)|/(2\chi(G)), which establishes the conjecture for graphs of bounded chromatic number. The conjecture is also known for trees and graphs of maximum degree 33; this paper confirms it for graphs of treewidth at most two with c=25c=\frac{2}{5}, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.