/-
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.
-/
module
public import FormalConjecturesUtilWritten on the Wall II - Conjecture 438b
Reference: E. DeLaVina, Written on the Wall II, Conjectures of Graffiti.pc
WOWII 438b asks whether
alpha₂(G) ≤ alpha(G) + alpha(G[V \ H₂]) + |E(G[H₂])|,
where H₂ is the set of vertices of degree at most two. The conjecture is
true. In fact, the same inequality holds with an arbitrary vertex subset in
place of H₂.
@[expose] public sectionnamespace WrittenOnTheWallII.GraphConjecture438bopen SimpleGraph Finset
WOWII 438b states that every connected graph of order greater than three
satisfies
alpha₂(G) ≤ alpha(G) + alpha(G[V \ H₂]) + |E(G[H₂])|.
@[category research solved, question, AMS 5, formal_proof using lean4 at
"https://github.com/Kuberwastaken/c5-k4/blob/e62f216625438bc099707e466d2825ab483717a4/lean/GraphConjecture438b.lean"]
theorem conjecture438b :
∀ (V : Type) [Fintype V] [DecidableEq V] (G : SimpleGraph V)
[DecidableRel G.Adj], G.Connected → 3 < Fintype.card V →
alphaTwo G ≤ G.indepNum +
indepNumOn G (Finset.univ \ lowDegreeLayer G) +
(internalEdges G (lowDegreeLayer G)).card := ⊢ ∀ (V : Type) [inst : Fintype V] [inst_1 : DecidableEq V] (G : SimpleGraph V) [inst_2 : DecidableRel G.Adj],
G.Connected →
3 < Fintype.card V →
G.alphaTwo ≤ α(G) + G.indepNumOn (univ \ G.lowDegreeLayer) + #(G.internalEdges G.lowDegreeLayer)
All goals completed! 🐙end WrittenOnTheWallII.GraphConjecture438b