/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
For a simple connected graph $G$,
$\mathrm{tree}(G) \ge (\mathrm{girth}(G) + 1) / \sigma(G)$,
where $\mathrm{tree}(G)$ is the largest induced tree size, $\mathrm{girth}(G)$
is the length of the shortest cycle, and
$\sigma(G) = G.\mathrm{secondSmallestDegree}$ is the second-smallest degree
of $G$'s degree sequence (per WOWII defEntry 65). We state the inequality in
denominator-free form to avoid the $\sigma = 0$ corner case ($n \le 1$).
The proof splits into the acyclic case and two cyclic cases. For an acyclic
graph the girth is zero. If $\sigma \ge 2$, deleting two consecutive edges from
a shortest cycle leaves an induced tree on $\mathrm{girth}(G)-1$ vertices, and
the factor $\sigma \ge 2$ yields the required inequality. If $\sigma = 1$,
there are two degree-one vertices. A maximal induced tree containing them must
have an external vertex with two attachments; those attachments create a cycle
whose length forces the tree to contain at least $\mathrm{girth}(G)+1$ vertices.