Maximum odd induced subgraph of a graph concerning its chromatic number

Tao Wang, Baoyindureng Wu

Let $f_o(G)$ be the maximum order of an odd induced subgraph of $G$. In 1992, Scott proposed a conjecture that $f_o(G)\ge \frac{n}{2\chi (G)}$ for a graph $G$ of order $n$ witho…