Qing-Hou Zeng

On Large Odd Induced Subgraphs of Graphs

For a graph $G$, an odd induced subgraph of $G$ is an induced subgraph in which every vertex has odd degree (within the subgraph). Let $f_o(G)$ denote the maximum size of such a subgraph in $G$. Caro conjectured that there exists a positive constant $c$ such that $f_o(G)≥cn$ for any $n$-vertex graph without isolated ve...