/-
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 96
Verbatim statement (WOWII #96, status O):
If G is a simple connected graph, then α(G) ≤ 1 + minimum dist_even(v)*(maximum of λ(v) -1)
Source: http://cms.uhd.edu/faculty/delavinae/research/wowII/all.html#conj96
Reference: E. DeLaVina, Written on the Wall II, Conjectures of Graffiti.pc
@[expose] public sectionnamespace WrittenOnTheWallII.GraphConjecture96open SimpleGraphvariable {α : Type*} [Fintype α] [DecidableEq α] [Nontrivial α]WOWII Conjecture 96
For a simple connected graph G on at least two vertices,
α(G) ≤ 1 + min_v distEven(v) · (max_v l(v) - 1)
where α(G) = G.indepNum is the independence number,
distEven(v) is the number of vertices at even distance from v, and
max_v l(v) is the maximum independence number of a vertex neighbourhood.
We record the nontrivial-graph version: the literal source inequality fails on $K_1$, where the independence number and even-distance count are both one, but the maximum local independence number is zero, giving $1 ≤ 0$.
@[category research open, AMS 5]
theorem conjecture96 (G : SimpleGraph α) (h : G.Connected) :
let minDistEven := (Finset.univ.image (distEven G)).min' (α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph αh:G.Connected⊢ (Finset.image G.distEven Finset.univ).Nonempty All goals completed! 🐙)
let maxL := (Finset.univ.image (fun v => indepNeighborsCard G v)).max' (α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph αh:G.ConnectedminDistEven:ℕ := (Finset.image G.distEven Finset.univ).min' ⋯⊢ (Finset.image (fun v ↦ G.indepNeighborsCard v) Finset.univ).Nonempty All goals completed! 🐙)
(G.indepNum : ℝ) ≤ 1 + (minDistEven : ℝ) * ((maxL : ℝ) - 1) := α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph αh:G.Connected⊢ let minDistEven := (Finset.image G.distEven Finset.univ).min' ⋯;
let maxL := (Finset.image (fun v ↦ G.indepNeighborsCard v) Finset.univ).max' ⋯;
↑α(G) ≤ 1 + ↑minDistEven * (↑maxL - 1)
All goals completed! 🐙-- Sanity checks
The independence number is nonneg.
@[category test, AMS 5]
example (G : SimpleGraph (Fin 3)) : 0 ≤ G.indepNum := Nat.zero_le _The independence number is nonneg.
@[category test, AMS 5]
example (G : SimpleGraph (Fin 3)) : 0 ≤ G.indepNum := Nat.zero_le _end WrittenOnTheWallII.GraphConjecture96