Maximum odd induced subgraph of a graph concerning its chromatic number

Abstract

AbstractLet be the maximum order of an odd induced subgraph of . In 1992, Scott proposed a conjecture that for a graph of order without isolated vertices, where is the chromatic number of . 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 for a connected graph of order . Scott's conjecture is open for graphs with chromatic number at least 3.