2 problems

Let $G=(V,E)$ be a finite simple graph with $n=|V|$ vertices and no isolated vertices. An odd induced subgraph is an induced subgraph in which every vertex has odd degree, and let…

Let $G$ be a graph. Let $f_{\mathrm{o}}(G)$ denote the maximum order of an induced subgraph in which every vertex has odd degree, and let $f_{\mathrm{oe}}(G)$ denote the minimum, o…