combinatorics / Graph Theory (automated conjecture)
For every finite connected simple graph $G$, is the order of the largest induced tree at least $\mathrm{girth}(G) - 1 + \mathrm{ecc}(G, \mathrm{center}(G))$, where the last term is the eccentricity of the centre set? Answered affirmatively, with a Lean proof.
Temporal state
No reconciled state yet.
Append-only history
The Formal Conjectures pull request flipping this from open to solved is still open rather than merged, so the canonical repository has not yet accepted it.
Research memory
For every finite connected simple graph $G$, is the order of the largest induced tree at least $\mathrm{girth}(G) - 1 + \mathrm{ecc}(G, \mathrm{center}(G))$, where the last term is the eccentricity of the centre set? Answered affirmatively, with a Lean proof.
The Formal Conjectures pull request flipping this from open to solved is still open rather than merged, so the canonical repository has not yet accepted it.
Evidence graph
No public relationships recorded yet.