Odd Induced Subgraphs in Graphs of Maximum Degree Four

Jiangdong Ai, Qiwen Guo, Gregory Gutin +2

A graph is called odd if all of its vertex degrees are odd. A long-standing conjecture asked whether there exists a positive constant $c$ such that every $n$-vertex graph without i…