1 problem

Let $G$ be a connected triangle-free graph with $n\geq 3$ vertices and $m$ edges. Here, $h(G)$ denotes the maximum number of edges in an uncrossed subgraph of $G$. Triangle-free ti…