/-
Copyright 2025 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.
-/
module
public import FormalConjecturesUtilWritten on the Wall II - Conjecture 72
Verbatim statement (WOWII #72, status O):
If G is a simple connected graph, then tree(G) ≥ CEIL[average of ecc(v) + maximum of λ(v) /3]
Source: http://cms.uhd.edu/faculty/delavinae/research/wowII/all.html#conj72
Reference: E. DeLaVina, Written on the Wall II, Conjectures of Graffiti.pc
@[expose] public sectionnamespace WrittenOnTheWallII.GraphConjecture72open SimpleGraphvariable {α : Type*} [Fintype α] [DecidableEq α] [Nontrivial α]WOWII Conjecture 72
For a simple connected graph G,
$\operatorname{tree}(G) ≥ ⌈\operatorname{ecc}_{\mathrm{avg}}(G) + \max_v \lambda(v)/3⌉$
where tree(G) is the number of vertices in a largest induced tree,
ecc_avg(G) is the average eccentricity of G, and
max_v l(v) = max_v indepNeighborsCard G v is the maximum over all vertices of
the independence number of the neighbourhood.
@[category research open, AMS 5]
theorem conjecture72 (G : SimpleGraph α) (h : G.Connected) :
let maxL := (Finset.univ.image (fun v => indepNeighborsCard G v)).max' (α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph αh:G.Connected⊢ (Finset.image (fun v ↦ G.indepNeighborsCard v) Finset.univ).Nonempty All goals completed! 🐙)
⌈averageEccentricity G + (maxL : ℝ) / 3⌉ ≤ (largestInducedTreeSize G : ℝ) := α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph αh:G.Connected⊢ let maxL := (Finset.image (fun v ↦ G.indepNeighborsCard v) Finset.univ).max' ⋯;
↑⌈G.averageEccentricity + ↑maxL / 3⌉ ≤ ↑G.largestInducedTreeSize
All goals completed! 🐙-- Sanity checks
The largestInducedTreeSize is nonneg.
@[category test, AMS 5]
example (G : SimpleGraph (Fin 3)) : 0 ≤ largestInducedTreeSize G := Nat.zero_le _The average eccentricity is nonneg.
@[category test, AMS 5]
example (G : SimpleGraph (Fin 3)) : 0 ≤ averageEccentricity G := α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)⊢ 0 ≤ G.averageEccentricity
α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)⊢ 0 ≤ ↑(∑ v, (G.eccent v).toNat) / ↑(Fintype.card (Fin 3))
All goals completed! 🐙end WrittenOnTheWallII.GraphConjecture72