Maximum odd induced subgraph of a graph concerning its chromatic number

Let $f_o\left(G\right)$ be the maximum order of an odd induced subgraph of $G$. In 1992, Scott proposed a conjecture that $f_o\left(G\right)\ge \frac{n}{\chi \left(G\right)}$ for a graph $G$ of order $n$ without isolated vertices, where $\chi \left(G\right)$ is the chromatic number of $G$. In this paper, we show that the conjecture is not true for bipartite graphs, but is true for all line graphs. In addition, we also disprove a conjecture of Berman, Wang, and Wargo in 1997, which states that $f_o\left(G\right)\ge 2\left(\frac{n}{4}\right)$ for a connected graph $G$ of order $n$. Scott's conjecture is open for graphs with chromatic number at least 3.