1 problem

Let $G$ be a connected graph with $n \geq 4$ vertices, $m \geq n$ edges, and an odd cycle. The Hansen–Li–Liu conjecture. asserts that … Moreover, the bound should be best possible,…