FormalConjectures.WrittenOnTheWallII.GraphConjecture16

/-
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.
-/

import FormalConjecturesUtil

Written on the Wall II - Conjecture 16

Reference: E. DeLaVina, Written on the Wall II, Conjectures of Graffiti.pc

namespace WrittenOnTheWallII.GraphConjecture16open SimpleGraphvariable {α : Type*} [Fintype α] [DecidableEq α] [Nontrivial α]

WOWII Conjecture 16

For a simple connected graph G, the size b(G) of a largest induced bipartite subgraph satisfies b(G) ≥ 2 * (rad(G) - 1) + max_{v ∈ V} l(v), where rad(G) is the radius of G (the minimum eccentricity) and l(v) = indepNeighborsCard G v is the independence number of the neighbourhood of v.

@[category research solved, AMS 5]
theorem conjecture16 (G : SimpleGraph α) (h : G.Connected) :
    letI maxL := (Finset.univ.image (fun v => indepNeighborsCard G v)).max' (byα:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph αh:G.Connected⊢ (Finset.image (fun v ↦ G.indepNeighborsCard v) Finset.univ).Nonempty simpAll goals completed! 🐙)
    letI r := G.radius.toNat
    2 * ((r : ℝ) - 1) + (maxL : ℝ) ≤ b G := byα:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph αh:G.Connected⊢ 2 * (↑G.radius.toNat - 1) + ↑((Finset.image (fun v ↦ G.indepNeighborsCard v) Finset.univ).max' ⋯) ≤ G.b
  sorryAll goals completed! 🐙

-- Sanity checks

The invariant b G (largest induced bipartite subgraph size) is nonneg.

@[category test, AMS 5]
example (G : SimpleGraph (Fin 3)) : 0 ≤ b G := Nat.cast_nonneg _

In K₂, the max degree is 1.

@[category test, AMS 5]
example : (⊤ : SimpleGraph (Fin 2)).maxDegree = 1 := byα:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial α⊢ ⊤.maxDegree = 1 decide +nativeAll goals completed! 🐙

end WrittenOnTheWallII.GraphConjecture16